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 20:41olliecrowolliecrowScore: 7,084Success
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 20:416,54283,386,10451,286,0003,016,0002,330,624
2Feb 11, 2026 20:416,55780,103,44949,385,0005,039,0002,408,448
3Feb 11, 2026 20:416,64390,103,51651,130,0004,010,0002,310,144
4Feb 11, 2026 20:417,08486,169,66354,810,0003,986,0002,482,176
5Feb 11, 2026 20:417,39392,963,15356,336,0005,030,0002,412,544
6Feb 11, 2026 20:417,44589,706,46857,742,0004,052,0002,318,336