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 19, 2026 07:27Victor MerckléVictor MerckléScore: 6,448Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 07:286,35462,338,76951,736,0001,007,0002,113,536
2May 19, 2026 07:286,36063,029,29051,753,0001,035,0002,113,536
3May 19, 2026 07:286,40263,748,49552,110,0001,034,0002,113,536
4May 19, 2026 07:286,43764,285,89752,425,0001,009,0002,113,536
5May 19, 2026 07:286,44861,334,38452,492,0001,029,0002,113,536
6May 19, 2026 07:286,50864,081,94952,938,0001,079,0002,113,536
7May 19, 2026 07:286,54962,117,01253,356,0001,008,0002,113,536
8May 19, 2026 07:286,55463,554,59253,387,0001,012,0002,113,536
9May 19, 2026 07:286,56464,455,86653,483,0001,000,0002,113,536