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 listSep 7, 2026 20:01Victor MerckléVictor MerckléScore: 51,197Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 20:0251,116432,832,936419,952,0004,312,00024,576stderr
2Sep 7, 2026 20:0251,174435,343,432420,345,0004,403,00024,576stderr
3Sep 7, 2026 20:0251,180434,047,357420,042,0004,760,00024,576stderr
4Sep 7, 2026 20:0251,187433,399,499420,429,0004,424,00024,576stderr
5Sep 7, 2026 20:0251,197434,268,650420,614,0004,326,00024,576stderr
6Sep 7, 2026 20:0251,459436,329,316422,908,0004,206,00024,576stderr
7Sep 7, 2026 20:0251,564436,637,085423,401,0004,588,00024,576stderr
8Sep 7, 2026 20:0251,565437,337,758423,307,0004,690,00024,576stderr
9Sep 7, 2026 20:0251,879439,811,845425,953,0004,644,00024,576stderr