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 listMay 24, 2026 19:38Maya RebholzMaya RebholzScore: 8,302Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 19:388,04376,084,34661,506,0005,253,0002,117,632
2May 24, 2026 19:388,09076,555,60761,658,0005,495,0002,117,632
3May 24, 2026 19:388,20383,413,38762,354,0005,737,0002,113,536
4May 24, 2026 19:388,24080,902,42463,084,0005,314,0002,113,536
5May 24, 2026 19:388,30279,549,81963,366,0005,546,0002,117,632
6May 24, 2026 19:388,44579,521,12664,421,0005,679,0002,117,632
7May 24, 2026 19:388,53482,326,41965,271,0005,567,0002,113,536
8May 24, 2026 19:388,72287,886,84666,443,0005,950,0002,117,632
9May 24, 2026 19:389,04790,639,23266,763,0008,330,0002,117,632