This is the goal: count from 0 all the way to the current epoch time while the epoch time is still advancing in the fastest time possible. An example of how you'd do it could be as what is shown here in Python 2.7:
from time import time start, end, count = None, None, 0 while count <= time(): if start == None: start = time() count += 1 end = time()
The above code took 10 minutes and 8 seconds to run through on an 8-core AMD with 16 GB of RAM. You must do it faster than that without skipping numbers and starting from zero.
Achieving a lower time than what Python did is the goal in addition to using the least amount of code too, but special attention will be given to the following:
- Code that takes the precise epoch time sourced from your counting to display something mentioning historical events or irrelevant ones that can be found on Wikipedia. (10 points)
- Getting the current epoch time from a source other than your own. (5 points)
- Your application continues to count alongside the epoch time after it catches up. (5 points)
50 points will be awarded to the person who achieves the lowest time and additional bonus points will be awarded from above if they're met.
The contest closes June 1st.