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 16, 2026 17:41wnwnScore: 8,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 17:417,68491,827,77357,800,0005,979,0002,293,760
2Feb 16, 2026 17:417,70794,017,53658,972,0004,997,0002,297,856
3Feb 16, 2026 17:417,75793,591,92759,352,0005,029,0002,322,432
4Feb 16, 2026 17:418,65995,804,31965,884,0005,989,0002,482,176
5Feb 16, 2026 17:418,69795,409,91166,166,0006,015,0002,285,568
6Feb 16, 2026 17:418,79497,548,98665,990,0006,998,0002,293,760