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 16, 2026 15:23marko1597marko1597Score: 5,818Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 15:255,78057,046,45246,843,0001,135,0002,117,632
2Aug 16, 2026 15:255,78157,211,51946,978,0001,005,0002,117,632
3Aug 16, 2026 15:255,79158,638,71547,064,0001,008,0002,117,632
4Aug 16, 2026 15:255,80456,650,10047,167,0001,007,0002,117,632
5Aug 16, 2026 15:255,81856,766,24147,105,0001,185,0002,117,632
6Aug 16, 2026 15:255,82357,427,17947,332,0001,007,0002,117,632
7Aug 16, 2026 15:255,86057,785,00647,635,0001,005,0002,117,632
8Aug 16, 2026 15:255,87957,969,67647,791,0001,007,0002,117,632
9Aug 16, 2026 15:255,93958,404,24648,272,0001,024,0002,117,632