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 25, 2026 10:43Victor MerckléVictor MerckléScore: 6,182Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 10:446,16259,306,60550,063,0001,083,0002,117,632stderr
2Aug 25, 2026 10:446,17559,367,57150,199,0001,056,0002,117,632stderr
3Aug 25, 2026 10:446,17859,447,84450,253,0001,029,0002,117,632stderr
4Aug 25, 2026 10:446,17859,641,10750,252,0001,027,0002,117,632stderr
5Aug 25, 2026 10:446,18259,477,73350,280,0001,038,0002,117,632stderr
6Aug 25, 2026 10:446,18459,520,88950,290,0001,038,0002,117,632stderr
7Aug 25, 2026 10:446,38461,303,96051,947,0001,045,0002,117,632stderr
8Aug 25, 2026 10:446,42661,569,89552,313,0001,025,0002,117,632stderr
9Aug 25, 2026 10:446,42761,732,59152,263,0001,089,0002,117,632stderr