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 10:48Josu San MartinJosu San MartinScore: 4,101Success
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 10:494,07950,774,48332,747,0001,114,0002,494,464
2May 10, 2026 10:494,09251,122,84932,908,0001,058,0002,482,176
3May 10, 2026 10:494,09348,349,98232,951,0001,029,0002,490,368
4May 10, 2026 10:494,09948,670,86133,007,0001,021,0002,478,080
5May 10, 2026 10:494,10150,823,33132,988,0001,052,0002,498,560
6May 10, 2026 10:494,11449,707,73333,104,0001,046,0002,478,080
7May 10, 2026 10:494,11550,126,21933,115,0001,045,0002,494,464
8May 10, 2026 10:494,13348,788,37533,244,0001,066,0002,486,272
9May 10, 2026 10:494,13949,370,51833,322,0001,036,0002,482,176