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 28, 2026 18:23Victor MerckléVictor MerckléScore: 7,155Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 18:247,07367,784,77257,691,0001,017,0002,117,632stderr
2Aug 28, 2026 18:247,13968,278,54058,236,0001,020,0002,117,632stderr
3Aug 28, 2026 18:247,14068,333,96658,256,0001,010,0002,117,632stderr
4Aug 28, 2026 18:247,14667,738,07858,298,0001,014,0002,117,632stderr
5Aug 28, 2026 18:247,15568,332,96258,385,0001,005,0002,117,632stderr
6Aug 28, 2026 18:247,16368,500,07758,450,0001,009,0002,117,632stderr
7Aug 28, 2026 18:247,25068,504,28859,161,0001,014,0002,117,632stderr
8Aug 28, 2026 18:247,29469,575,06959,536,0001,005,0002,117,632stderr
9Aug 28, 2026 18:247,29869,583,54759,556,0001,023,0002,117,632stderr