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 listJul 21, 2026 22:24Kevin HeaveyKevin HeaveyScore: 3,803Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 22:253,74340,668,21028,840,0002,233,0002,117,632
2Jul 21, 2026 22:253,74940,681,13728,881,0002,237,0002,117,632
3Jul 21, 2026 22:253,76141,044,87128,944,0002,276,0002,117,632
4Jul 21, 2026 22:253,78541,063,80229,136,0002,285,0002,117,632
5Jul 21, 2026 22:253,80341,176,03829,508,0002,059,0002,117,632
6Jul 21, 2026 22:253,80641,218,03729,294,0002,302,0002,117,632
7Jul 21, 2026 22:253,82243,641,25829,412,0002,314,0002,117,632
8Jul 21, 2026 22:253,82441,458,48029,448,0002,293,0002,117,632
9Jul 21, 2026 22:254,25244,908,46532,987,0002,308,0002,117,632