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 25, 2026 20:13Daniel MastalerzDaniel MastalerzScore: 5,469Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 25, 2026 20:135,40075,100,54441,832,0002,988,0002,293,760
2Feb 25, 2026 20:135,43072,660,22343,067,0002,003,0002,293,760
3Feb 25, 2026 20:135,44574,187,34842,180,0003,012,0002,416,640
4Feb 25, 2026 20:135,46976,313,05043,373,0002,017,0002,420,736
5Feb 25, 2026 20:135,52174,398,60242,837,0002,988,0002,285,568
6Feb 25, 2026 20:135,52471,833,66744,851,000996,0002,285,568