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 18:40Josu San MartinJosu San MartinScore: 4,073Success
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 18:404,05143,936,99732,604,0001,022,0002,113,536
2May 10, 2026 18:404,05443,281,02232,521,0001,130,0002,113,536
3May 10, 2026 18:404,06542,921,39632,653,0001,089,0002,113,536
4May 10, 2026 18:404,07243,341,21832,719,0001,085,0002,113,536
5May 10, 2026 18:404,07344,161,67932,770,0001,036,0002,113,536
6May 10, 2026 18:404,09943,242,02232,935,0001,090,0002,113,536
7May 10, 2026 18:404,10042,241,37232,875,0001,161,0002,113,536
8May 10, 2026 18:404,11944,234,29933,159,0001,033,0002,113,536
9May 10, 2026 18:404,12244,145,92333,105,0001,110,0002,113,536