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 04:12Victor MerckléVictor MerckléScore: 8,148Success
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 04:138,08475,178,98945,620,00021,478,0002,117,632stderr
2Jul 7, 2026 04:138,10775,440,45445,674,00021,621,0002,117,632stderr
3Jul 7, 2026 04:138,11375,475,21745,671,00021,668,0002,117,632stderr
4Jul 7, 2026 04:138,13375,620,03145,645,00021,864,0002,117,632stderr
5Jul 7, 2026 04:138,14875,800,57445,687,00021,946,0002,117,632stderr
6Jul 7, 2026 04:138,14975,810,48645,608,00022,033,0002,117,632stderr
7Jul 7, 2026 04:138,15775,935,25945,654,00022,056,0002,117,632stderr
8Jul 7, 2026 04:138,21776,431,08445,626,00022,579,0002,117,632stderr
9Jul 7, 2026 04:138,45578,307,67345,677,00024,500,0002,117,632stderr