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 20:32Victor MerckléVictor MerckléScore: 4,779Success
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 20:334,77548,695,32738,615,0001,022,0002,117,632stderr
2Aug 28, 2026 20:334,77648,712,10038,626,0001,021,0002,117,632stderr
3Aug 28, 2026 20:334,77748,740,92638,634,0001,023,0002,117,632stderr
4Aug 28, 2026 20:334,77848,747,05938,635,0001,027,0002,117,632stderr
5Aug 28, 2026 20:334,77948,726,39638,621,0001,045,0002,117,632stderr
6Aug 28, 2026 20:334,80248,947,92838,842,0001,020,0002,117,632stderr
7Aug 28, 2026 20:334,80748,970,22638,883,0001,020,0002,117,632stderr
8Aug 28, 2026 20:334,81649,011,13638,953,0001,020,0002,117,632stderr
9Aug 28, 2026 20:334,83149,158,41539,083,0001,020,0002,117,632stderr