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 listAug 11, 2026 13:02Victor MerckléVictor MerckléScore: 3,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 13:033,84740,097,71930,809,0001,129,0002,117,632stderr
2Aug 11, 2026 13:033,84940,153,50230,855,0001,098,0002,117,632stderr
3Aug 11, 2026 13:033,85741,262,64630,893,0001,127,0002,117,632stderr
4Aug 11, 2026 13:033,86440,236,75030,977,0001,099,0002,117,632stderr
5Aug 11, 2026 13:033,86540,475,24130,862,0001,220,0002,117,632stderr
6Aug 11, 2026 13:033,88240,590,82631,116,0001,108,0002,117,632stderr
7Aug 11, 2026 13:033,90640,804,55231,302,0001,119,0002,117,632stderr
8Aug 11, 2026 13:033,98341,185,49431,937,0001,127,0002,117,632stderr
9Aug 11, 2026 13:034,06742,177,60732,649,0001,112,0002,117,632stderr