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 11:03Victor MerckléVictor MerckléScore: 3,790Success
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 11:043,76839,633,70730,214,0001,062,0002,117,632stderr
2Aug 25, 2026 11:043,77939,716,37330,256,0001,114,0002,117,632stderr
3Aug 25, 2026 11:043,78139,832,86630,265,0001,121,0002,117,632stderr
4Aug 25, 2026 11:043,78239,787,09630,323,0001,075,0002,117,632stderr
5Aug 25, 2026 11:043,79039,818,44930,358,0001,101,0002,117,632stderr
6Aug 25, 2026 11:043,79339,900,93830,391,0001,092,0002,117,632stderr
7Aug 25, 2026 11:043,79539,921,97530,417,0001,089,0002,117,632stderr
8Aug 25, 2026 11:043,80639,941,64830,501,0001,089,0002,117,632stderr
9Aug 25, 2026 11:043,82840,118,36830,679,0001,101,0002,117,632stderr