Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listSep 4, 2024 09:44ErnKiewErnKiewScore: 391,039Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2024 09:44390,8883,267,579,7063,169,412,00074,962,0002,293,760
2Sep 4, 2024 09:44390,9213,273,784,9473,172,699,00071,947,0002,293,760
3Sep 4, 2024 09:44390,9603,277,408,7643,189,002,00055,964,0002,510,848
4Sep 4, 2024 09:44391,0283,282,553,8713,180,559,00064,970,0002,285,568
5Sep 4, 2024 09:44391,0393,270,530,5683,170,680,00074,945,0002,519,040
6Sep 4, 2024 09:44391,5603,280,104,9503,184,991,00064,959,0002,510,848
7Sep 4, 2024 09:44394,5693,301,272,0773,205,942,00068,977,0002,519,040
8Sep 4, 2024 09:44394,6763,304,355,7333,206,860,00068,954,0002,510,848
9Sep 4, 2024 09:44403,2153,375,649,3343,276,710,00069,972,0002,289,664