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 24, 2026 18:44Victor MerckléVictor MerckléScore: 4,521Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 18:444,51045,054,57036,335,0001,104,0002,113,536
2Jun 24, 2026 18:444,51045,027,41336,358,0001,081,0002,113,536
3Jun 24, 2026 18:444,51644,949,39536,406,0001,077,0002,113,536
4Jun 24, 2026 18:444,52045,173,18936,400,0001,116,0002,113,536
5Jun 24, 2026 18:444,52145,060,02536,423,0001,104,0002,113,536
6Jun 24, 2026 18:444,53445,105,61536,630,0001,009,0002,113,536
7Jun 24, 2026 18:444,53445,133,63636,544,0001,091,0002,113,536
8Jun 24, 2026 18:444,53845,301,55536,587,0001,083,0002,113,536
9Jun 24, 2026 18:444,53945,147,16736,564,0001,117,0002,113,536