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 23, 2026 19:22Victor MerckléVictor MerckléScore: 3,769Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 19:233,72339,360,70129,676,0001,230,0002,117,632stderr
2Aug 23, 2026 19:233,75740,249,84830,023,0001,163,0002,117,632stderr
3Aug 23, 2026 19:233,76239,632,07530,133,0001,099,0002,117,632stderr
4Aug 23, 2026 19:233,76839,787,24730,115,0001,166,0002,117,632stderr
5Aug 23, 2026 19:233,76939,641,28030,180,0001,110,0002,117,632stderr
6Aug 23, 2026 19:233,77639,805,03930,204,0001,137,0002,117,632stderr
7Aug 23, 2026 19:233,79139,867,61330,360,0001,108,0002,117,632stderr
8Aug 23, 2026 19:233,90240,750,51131,334,0001,059,0002,117,632stderr
9Aug 23, 2026 19:234,02341,888,87432,254,0001,140,0002,117,632stderr