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 9, 2026 05:44Victor MerckléVictor MerckléScore: 22,197Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 05:4521,915191,727,690180,772,0001,124,0002,117,632stderr
2Jul 9, 2026 05:4522,072191,333,567182,197,0001,005,0002,117,632stderr
3Jul 9, 2026 05:4522,098191,546,256182,260,0001,155,0002,117,632stderr
4Jul 9, 2026 05:4522,130191,775,872182,636,0001,044,0002,117,632stderr
5Jul 9, 2026 05:4522,197192,307,343183,217,0001,019,0002,117,632stderr
6Jul 9, 2026 05:4522,215192,481,864183,337,0001,054,0002,117,632stderr
7Jul 9, 2026 05:4522,263192,928,003183,647,0001,143,0002,117,632stderr
8Jul 9, 2026 05:4522,311193,241,929184,135,0001,049,0002,117,632stderr
9Jul 9, 2026 05:4522,352193,655,894184,488,0001,037,0002,117,632stderr