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 17, 2026 01:41Andrew EpsteinAndrew EpsteinScore: 6,895Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 01:416,84066,950,22455,626,0001,151,0002,117,632stderr
2Sep 17, 2026 01:416,85867,045,09055,802,0001,127,0002,117,632stderr
3Sep 17, 2026 01:416,86867,205,87855,805,0001,201,0002,117,632stderr
4Sep 17, 2026 01:416,87167,302,20055,885,0001,145,0002,117,632stderr
5Sep 17, 2026 01:416,89567,405,53356,078,0001,156,0002,117,632stderr
6Sep 17, 2026 01:416,89967,353,19156,128,0001,138,0002,117,632stderr
7Sep 17, 2026 01:416,92867,732,61756,360,0001,145,0002,117,632stderr
8Sep 17, 2026 01:416,92967,643,47356,357,0001,155,0002,117,632stderr
9Sep 17, 2026 01:417,15380,240,71858,183,0001,192,0002,117,632stderr