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 21, 2026 15:58Juraj ZelmanJuraj ZelmanScore: 7,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 15:587,83697,115,54664,035,0001,000,0002,285,568
2Feb 21, 2026 15:587,87893,993,88665,389,00002,371,584
3Feb 21, 2026 15:587,882100,239,55664,415,0001,006,0002,371,584
4Feb 21, 2026 15:587,93291,568,34864,842,000997,0002,367,488
5Feb 21, 2026 15:587,93391,865,35864,846,000997,0002,371,584
6Feb 21, 2026 15:587,95499,723,91764,015,0002,000,0002,363,392