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 26, 2026 23:09Victor MerckléVictor MerckléScore: 3,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 23:103,76140,240,45930,052,0001,168,0002,117,632stderr
2Aug 26, 2026 23:103,77339,477,94130,104,0001,214,0002,117,632stderr
3Aug 26, 2026 23:103,77639,770,57630,175,0001,168,0002,117,632stderr
4Aug 26, 2026 23:103,79539,880,30830,429,0001,076,0002,117,632stderr
5Aug 26, 2026 23:103,79739,863,71530,412,0001,104,0002,117,632stderr
6Aug 26, 2026 23:103,80039,886,66230,421,0001,124,0002,117,632stderr
7Aug 26, 2026 23:103,81740,107,55830,597,0001,089,0002,117,632stderr
8Aug 26, 2026 23:103,96641,292,14031,831,0001,087,0002,117,632stderr
9Aug 26, 2026 23:104,03142,587,44732,359,0001,105,0002,117,632stderr