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 05:55Josu San MartinJosu San MartinScore: 4,268Success
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 05:554,16551,171,67633,438,0001,137,0002,482,176
2May 10, 2026 05:554,17452,311,40833,494,0001,155,0002,482,176
3May 10, 2026 05:554,17847,331,54933,559,0001,125,0002,486,272
4May 10, 2026 05:554,21153,369,11933,794,0001,161,0002,486,272
5May 10, 2026 05:554,26851,083,31934,293,0001,134,0002,494,464
6May 10, 2026 05:554,33753,689,69234,819,0001,185,0002,486,272
7May 10, 2026 05:554,34851,189,79834,952,0001,142,0002,482,176
8May 10, 2026 05:554,35953,418,84935,042,0001,140,0002,482,176
9May 10, 2026 05:554,41755,230,91335,535,0001,130,0002,486,272