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 02:46Victor MerckléVictor MerckléScore: 4,912Success
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 02:484,88148,281,36839,471,0001,046,0002,138,112
2Jun 10, 2026 02:484,88348,234,05839,493,0001,041,0002,138,112
3Jun 10, 2026 02:484,89548,426,07039,583,0001,047,0002,138,112
4Jun 10, 2026 02:484,90548,246,05839,658,0001,061,0002,138,112
5Jun 10, 2026 02:484,91248,565,82139,700,0001,077,0002,138,112
6Jun 10, 2026 02:484,92948,558,20439,856,0001,057,0002,138,112
7Jun 10, 2026 02:484,93849,021,31839,957,0001,031,0002,138,112
8Jun 10, 2026 02:484,97448,993,70840,258,0001,029,0002,138,112
9Jun 10, 2026 02:485,07549,702,67041,097,0001,027,0002,138,112