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 9, 2026 23:19Josu San MartinJosu San MartinScore: 4,874Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 23:194,81355,769,28438,925,0001,026,0002,363,392
2May 9, 2026 23:194,84758,285,25439,207,0001,028,0002,371,584
3May 9, 2026 23:194,86256,588,66839,330,0001,032,0002,363,392
4May 9, 2026 23:194,87156,213,72539,132,0001,304,0002,363,392
5May 9, 2026 23:194,87461,764,31839,408,0001,047,0002,371,584
6May 9, 2026 23:194,88156,157,69039,480,0001,035,0002,359,296
7May 9, 2026 23:194,91356,350,98539,750,0001,034,0002,363,392
8May 9, 2026 23:194,91656,732,13039,763,0001,046,0002,359,296
9May 9, 2026 23:195,05557,712,98840,663,0001,296,0002,359,296