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 19, 2026 17:12Daniel MastalerzDaniel MastalerzScore: 6,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 17:126,26374,618,35347,981,0003,998,0002,265,088
2Feb 19, 2026 17:126,28375,605,01049,137,0003,008,0002,306,048
3Feb 19, 2026 17:126,28380,113,32748,141,0004,011,0002,269,184
4Feb 19, 2026 17:126,36481,828,17549,831,0002,989,0002,318,336
5Feb 19, 2026 17:126,38176,458,42948,965,0003,997,0002,318,336
6Feb 19, 2026 17:126,40478,048,54749,139,0004,011,0002,285,568