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 17, 2026 00:35Andrew EpsteinAndrew EpsteinScore: 3,647Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 00:363,61240,118,62228,885,0001,101,0002,113,536
2Sep 17, 2026 00:363,61440,200,25328,879,0001,118,0002,113,536
3Sep 17, 2026 00:363,62240,214,53828,950,0001,118,0002,113,536
4Sep 17, 2026 00:363,62740,227,50428,976,0001,135,0002,113,536
5Sep 17, 2026 00:363,64740,482,77729,156,0001,121,0002,113,536
6Sep 17, 2026 00:363,64840,428,92929,145,0001,137,0002,113,536
7Sep 17, 2026 00:363,68540,716,57829,468,0001,123,0002,113,536
8Sep 17, 2026 00:363,74041,174,85129,919,0001,128,0002,113,536
9Sep 17, 2026 00:363,80841,881,30830,494,0001,118,0002,113,536