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 listSep 13, 2026 22:33Victor MerckléVictor MerckléScore: 3,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2026 22:363,48739,366,33427,817,0001,128,0002,117,632stderr
2Sep 13, 2026 22:363,49339,460,50227,853,0001,140,0002,117,632stderr
3Sep 13, 2026 22:363,49738,874,23427,900,0001,132,0002,117,632stderr
4Sep 13, 2026 22:363,49938,877,45327,911,0001,132,0002,117,632stderr
5Sep 13, 2026 22:363,50039,479,71427,929,0001,126,0002,117,632stderr
6Sep 13, 2026 22:363,53539,833,99428,224,0001,120,0002,117,632stderr
7Sep 13, 2026 22:363,56239,390,99328,434,0001,135,0002,117,632stderr
8Sep 13, 2026 22:363,56940,085,54428,506,0001,120,0002,117,632stderr
9Sep 13, 2026 22:363,62848,445,91029,108,0001,011,0002,117,632stderr