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 listMar 11, 2026 14:53caandocaandoScore: 5,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 11, 2026 14:534,96667,963,66839,207,0002,010,0002,260,992
2Mar 11, 2026 14:534,98666,669,21839,369,0002,018,0002,285,568
3Mar 11, 2026 14:535,04273,542,72939,859,0001,992,0002,285,568
4Mar 11, 2026 14:535,04967,527,81538,913,0002,993,0002,514,944
5Mar 11, 2026 14:535,07261,437,82940,092,0002,004,0002,285,568
6Mar 11, 2026 14:535,07361,605,15540,098,0002,004,0002,514,944