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 22:19olliecrowolliecrowScore: 6,207Success
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 22:195,85473,816,42345,549,0003,036,0002,330,624
2Feb 11, 2026 22:195,93473,444,56948,245,0001,005,0002,326,528
3Feb 11, 2026 22:196,09775,453,47247,567,0003,036,0002,420,736
4Feb 11, 2026 22:196,20783,225,64249,498,0002,020,0002,494,464
5Feb 11, 2026 22:196,28777,702,74150,175,0002,007,0002,428,928
6Feb 11, 2026 22:196,29384,287,55350,222,0002,008,0002,301,952