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 10, 2026 13:24wnwnScore: 3,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 13:253,24556,722,45826,936,00002,113,536
2May 10, 2026 13:253,25757,268,98526,030,0001,006,0002,113,536
3May 10, 2026 13:253,26956,349,16127,138,00002,113,536
4May 10, 2026 13:253,38656,544,95727,094,0001,011,0002,113,536
5May 10, 2026 13:253,39258,949,68028,156,00002,113,536
6May 10, 2026 13:253,40255,613,85128,238,00002,113,536
7May 10, 2026 13:253,40959,235,09028,297,00002,113,536
8May 10, 2026 13:253,41555,702,36828,351,00002,113,536
9May 10, 2026 13:253,45656,408,42727,667,0001,021,0002,113,536