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 listJul 6, 2026 22:14Victor MerckléVictor MerckléScore: 5,388Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 22:165,36852,602,73743,443,0001,112,0002,117,632stderr
2Jul 6, 2026 22:165,37252,664,44043,485,0001,104,0002,117,632stderr
3Jul 6, 2026 22:165,37852,680,61743,544,0001,095,0002,117,632stderr
4Jul 6, 2026 22:165,38452,758,99443,553,0001,136,0002,117,632stderr
5Jul 6, 2026 22:165,38852,758,34743,589,0001,132,0002,117,632stderr
6Jul 6, 2026 22:165,39252,889,55443,740,0001,019,0002,117,632stderr
7Jul 6, 2026 22:165,40052,932,47043,636,0001,191,0002,117,632stderr
8Jul 6, 2026 22:165,40152,892,87543,773,0001,062,0002,117,632stderr
9Jul 6, 2026 22:165,41252,951,94243,811,0001,109,0002,117,632stderr