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:03Juraj ZelmanJuraj ZelmanScore: 8,309Success
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:038,29595,245,47767,852,000997,0002,285,568
2Feb 21, 2026 15:038,295102,234,02466,852,0001,995,0002,375,680
3Feb 21, 2026 15:038,29799,725,02266,867,0001,996,0002,285,568
4Feb 21, 2026 15:038,309102,458,28367,963,000999,0002,293,760
5Feb 21, 2026 15:038,32694,924,25767,103,0002,003,0002,289,664
6Feb 21, 2026 15:038,33998,751,28668,212,0001,003,0002,367,488