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 listFeb 11, 2026 19:24olliecrowolliecrowScore: 6,353Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 19:245,82678,048,92740,299,0008,059,0002,338,816
2Feb 11, 2026 19:245,86477,276,51641,718,0006,953,0002,469,888
3Feb 11, 2026 19:245,86784,342,70942,735,0005,963,0002,338,816
4Feb 11, 2026 19:246,35384,260,38644,773,0007,959,0002,359,296
5Feb 11, 2026 19:246,47686,625,82547,781,0005,972,0002,482,176
6Feb 11, 2026 19:246,50882,550,47745,012,0009,002,0002,461,696