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 listJun 10, 2026 15:12Victor MerckléVictor MerckléScore: 6,998Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 15:136,94965,285,52556,583,0001,099,0002,113,536
2Jun 10, 2026 15:136,95565,380,67456,622,0001,106,0002,113,536
3Jun 10, 2026 15:136,98365,540,16656,868,0001,097,0002,113,536
4Jun 10, 2026 15:136,99865,690,26156,987,0001,102,0002,113,536
5Jun 10, 2026 15:136,99865,698,81356,972,0001,115,0002,113,536
6Jun 10, 2026 15:137,01865,838,23257,131,0001,126,0002,113,536
7Jun 10, 2026 15:137,08666,410,97957,804,0001,010,0002,113,536
8Jun 10, 2026 15:137,18867,235,92558,633,0001,030,0002,113,536
9Jun 10, 2026 15:137,66771,242,93962,547,0001,090,0002,113,536