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 7, 2026 09:16Victor MerckléVictor MerckléScore: 11,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 09:1711,838106,198,73497,157,0001,104,0002,117,632stderr
2Jul 7, 2026 09:1711,842106,360,84597,129,0001,163,0002,117,632stderr
3Jul 7, 2026 09:1711,850106,257,03697,359,0001,004,0002,117,632stderr
4Jul 7, 2026 09:1711,853106,235,74697,193,0001,191,0002,117,632stderr
5Jul 7, 2026 09:1711,860106,373,22297,434,0001,008,0002,117,632stderr
6Jul 7, 2026 09:1711,868106,318,60697,326,0001,179,0002,117,632stderr
7Jul 7, 2026 09:1711,875106,440,26597,415,0001,151,0002,117,632stderr
8Jul 7, 2026 09:1711,879106,560,32597,435,0001,166,0002,117,632stderr
9Jul 7, 2026 09:1711,887106,800,75797,646,0001,024,0002,117,632stderr