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 18, 2026 14:34Victor MerckléVictor MerckléScore: 22,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 14:3622,857197,429,336188,641,0001,075,0002,113,536
2Jun 18, 2026 14:3622,882197,637,565188,806,0001,115,0002,113,536
3Jun 18, 2026 14:3622,887197,613,838188,949,0001,019,0002,113,536
4Jun 18, 2026 14:3622,893197,745,031188,988,0001,025,0002,113,536
5Jun 18, 2026 14:3622,932200,150,877189,251,0001,091,0002,113,536
6Jun 18, 2026 14:3622,962198,350,351189,561,0001,024,0002,113,536
7Jun 18, 2026 14:3622,988198,525,890189,682,0001,124,0002,113,536
8Jun 18, 2026 14:3623,167201,094,415191,244,0001,049,0002,113,536
9Jun 18, 2026 14:3623,318201,198,306192,458,0001,082,0002,113,536