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 listMay 15, 2026 21:56Victor MerckléVictor MerckléScore: 6,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 21:566,95067,281,87756,658,0001,029,0002,113,536
2May 15, 2026 21:566,95064,969,62356,688,0001,003,0002,113,536
3May 15, 2026 21:566,95067,791,07956,685,0001,005,0002,113,536
4May 15, 2026 21:566,95167,952,04957,698,00002,113,536
5May 15, 2026 21:566,95164,990,38156,693,0001,007,0002,113,536
6May 15, 2026 21:566,95665,630,57256,694,0001,043,0002,113,536
7May 15, 2026 21:566,95867,857,54156,753,0001,004,0002,113,536
8May 15, 2026 21:566,96167,710,93556,756,0001,027,0002,113,536
9May 15, 2026 21:566,96268,033,95556,768,0001,019,0002,113,536