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 00:29Josu San MartinJosu San MartinScore: 3,887Success
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 00:293,86739,697,13530,999,0001,102,0002,113,536
2May 11, 2026 00:293,87142,013,40431,057,0001,079,0002,113,536
3May 11, 2026 00:293,88039,897,99331,150,0001,060,0002,113,536
4May 11, 2026 00:293,88639,602,81931,196,0001,058,0002,113,536
5May 11, 2026 00:293,88739,896,24031,187,0001,082,0002,113,536
6May 11, 2026 00:293,89139,922,27531,231,0001,069,0002,113,536
7May 11, 2026 00:293,91642,220,14431,421,0001,085,0002,113,536
8May 11, 2026 00:293,92441,134,97131,493,0001,083,0002,113,536
9May 11, 2026 00:293,94640,438,47831,666,0001,091,0002,113,536