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 14:44Victor MerckléVictor MerckléScore: 4,396Success
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 14:454,31144,201,60134,700,0001,085,0002,117,632stderr
2Aug 25, 2026 14:454,31344,198,05134,720,0001,080,0002,117,632stderr
3Aug 25, 2026 14:454,31544,258,88634,728,0001,090,0002,117,632stderr
4Aug 25, 2026 14:454,39645,573,33235,389,0001,104,0002,117,632stderr
5Aug 25, 2026 14:454,39645,790,02835,414,0001,081,0002,117,632stderr
6Aug 25, 2026 14:454,39944,916,17235,431,0001,084,0002,117,632stderr
7Aug 25, 2026 14:454,42045,698,74635,592,0001,100,0002,117,632stderr
8Aug 25, 2026 14:454,43045,140,35635,701,0001,068,0002,117,632stderr
9Aug 25, 2026 14:454,43045,195,51235,727,0001,042,0002,117,632stderr