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:14Andrew EpsteinAndrew EpsteinScore: 8,042Success
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:157,98576,402,49865,212,0001,065,0002,113,536
2Sep 17, 2026 00:158,03076,826,94265,584,0001,071,0002,113,536
3Sep 17, 2026 00:158,03076,799,90865,593,0001,063,0002,113,536
4Sep 17, 2026 00:158,03177,558,06965,596,0001,064,0002,113,536
5Sep 17, 2026 00:158,04277,119,34465,622,0001,128,0002,113,536
6Sep 17, 2026 00:158,04376,908,18365,757,0001,008,0002,113,536
7Sep 17, 2026 00:158,05076,950,75565,766,0001,052,0002,113,536
8Sep 17, 2026 00:158,05277,651,17965,760,0001,074,0002,113,536
9Sep 17, 2026 00:158,05877,187,48265,822,0001,065,0002,113,536