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 15, 2026 05:28Victor MerckléVictor MerckléScore: 3,493,633Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 05:323,493,22329,002,230,04128,990,749,0003,003,0002,117,632stderr
2May 15, 2026 05:323,493,29829,004,357,19828,993,377,0001,004,0002,117,632stderr
3May 15, 2026 05:323,493,33329,006,318,73128,993,523,0001,143,0002,117,632stderr
4May 15, 2026 05:323,493,45829,004,912,38328,990,590,0005,115,0002,117,632stderr
5May 15, 2026 05:323,493,63329,005,354,58828,994,159,0003,000,0002,117,632stderr
6May 15, 2026 05:323,493,83329,006,408,19228,997,821,0001,000,0002,117,632stderr
7May 15, 2026 05:323,493,85429,006,486,47528,997,826,0001,163,0002,117,632stderr
8May 15, 2026 05:323,493,93129,009,215,77228,998,624,0001,004,0002,117,632stderr
9May 15, 2026 05:323,494,05729,009,936,54428,998,658,0002,017,0002,117,632stderr