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 24, 2026 18:32Victor MerckléVictor MerckléScore: 5,077Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 18:324,77948,005,32938,572,0001,096,0002,117,632stderr
2Aug 24, 2026 18:324,80248,221,18538,742,0001,118,0002,117,632stderr
3Aug 24, 2026 18:325,05050,249,64240,907,0001,008,0002,117,632stderr
4Aug 24, 2026 18:325,07050,391,63041,074,0001,014,0002,117,632stderr
5Aug 24, 2026 18:325,07750,573,70041,124,0001,016,0002,117,632stderr
6Aug 24, 2026 18:325,17853,297,77641,969,0001,016,0002,117,632stderr
7Aug 24, 2026 18:325,32855,446,86343,199,0001,025,0002,117,632stderr
8Aug 24, 2026 18:325,49157,759,12943,349,0002,227,0002,117,632stderr
9Aug 24, 2026 18:325,61257,918,98045,567,0001,016,0002,117,632stderr