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 00:48Josu San MartinJosu San MartinScore: 4,786Success
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 00:484,69054,586,69037,849,0001,078,0002,478,080
2May 10, 2026 00:484,74851,676,30138,347,0001,065,0002,465,792
3May 10, 2026 00:484,76052,565,24638,438,0001,070,0002,482,176
4May 10, 2026 00:484,76252,118,25638,472,0001,053,0002,478,080
5May 10, 2026 00:484,78655,593,00838,545,0001,183,0002,469,888
6May 10, 2026 00:484,78757,964,66638,552,0001,187,0002,473,984
7May 10, 2026 00:484,86554,295,85739,310,0001,071,0002,478,080
8May 10, 2026 00:484,89155,806,41739,416,0001,184,0002,469,888
9May 10, 2026 00:485,18755,884,24141,885,0001,173,0002,469,888