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 02:25Josu San MartinJosu San MartinScore: 4,736Success
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 02:264,57756,195,36536,785,0001,212,0002,473,984
2May 10, 2026 02:264,57955,282,89736,815,0001,195,0002,473,984
3May 10, 2026 02:264,65855,628,22637,480,0001,185,0002,473,984
4May 10, 2026 02:264,72153,274,67738,003,0001,185,0002,469,888
5May 10, 2026 02:264,73655,881,68138,140,0001,177,0002,473,984
6May 10, 2026 02:264,77752,193,62538,466,0001,186,0002,473,984
7May 10, 2026 02:264,79557,195,47138,590,0001,213,0002,478,080
8May 10, 2026 02:264,79953,125,15638,661,0001,177,0002,461,696
9May 10, 2026 02:264,81955,697,49838,815,0001,188,0002,465,792