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 01:35Victor MerckléVictor MerckléScore: 7,080Success
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 01:366,97866,998,08556,786,0001,132,0002,117,632stderr
2Aug 25, 2026 01:367,01566,671,14857,099,0001,130,0002,117,632stderr
3Aug 25, 2026 01:367,02066,801,34857,130,0001,140,0002,117,632stderr
4Aug 25, 2026 01:367,03066,797,20157,215,0001,142,0002,117,632stderr
5Aug 25, 2026 01:367,08067,196,53957,632,0001,134,0002,117,632stderr
6Aug 25, 2026 01:367,09268,625,59057,676,0001,195,0002,117,632stderr
7Aug 25, 2026 01:367,10067,340,19057,798,0001,139,0002,117,632stderr
8Aug 25, 2026 01:367,31369,085,30759,640,0001,066,0002,117,632stderr
9Aug 25, 2026 01:367,33169,880,08159,759,0001,089,0002,117,632stderr