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 11, 2026 16:18Josu San MartinJosu San MartinScore: 3,915Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 16:183,87839,477,44031,105,0001,084,0002,113,536
2May 11, 2026 16:183,89240,906,73231,199,0001,109,0002,113,536
3May 11, 2026 16:183,89841,888,73131,273,0001,083,0002,113,536
4May 11, 2026 16:183,89842,090,32731,225,0001,135,0002,113,536
5May 11, 2026 16:183,91539,890,68331,409,0001,091,0002,113,536
6May 11, 2026 16:183,91540,544,72631,456,0001,046,0002,113,536
7May 11, 2026 16:183,92140,754,05531,446,0001,099,0002,113,536
8May 11, 2026 16:183,95141,906,63031,727,0001,069,0002,113,536
9May 11, 2026 16:184,03850,847,18732,368,0001,149,0002,113,536