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:00Victor MerckléVictor MerckléScore: 4,036Success
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:003,76339,443,49030,144,0001,092,0002,117,632stderr
2Aug 24, 2026 18:003,77639,761,63130,213,0001,132,0002,117,632stderr
3Aug 24, 2026 18:003,85041,752,83730,797,0001,163,0002,117,632stderr
4Aug 24, 2026 18:003,86941,153,50830,863,0001,253,0002,117,632stderr
5Aug 24, 2026 18:004,03644,598,74032,483,0001,019,0002,117,632stderr
6Aug 24, 2026 18:004,11447,489,00732,941,0001,213,0002,117,632stderr
7Aug 24, 2026 18:004,20145,477,23233,648,0001,227,0002,117,632stderr
8Aug 24, 2026 18:004,24546,525,25434,068,0001,171,0002,117,632stderr
9Aug 24, 2026 18:004,83753,703,56838,883,0001,268,0002,117,632stderr