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 10:38Victor MerckléVictor MerckléScore: 6,972Success
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 10:396,96466,612,36057,808,00002,113,536
2May 15, 2026 10:396,96965,156,51656,824,0001,021,0002,113,536
3May 15, 2026 10:396,97066,969,68856,825,0001,033,0002,113,536
4May 15, 2026 10:396,97165,715,68056,851,0001,015,0002,113,536
5May 15, 2026 10:396,97265,364,23756,828,0001,042,0002,113,536
6May 15, 2026 10:396,97466,006,46456,842,0001,046,0002,113,536
7May 15, 2026 10:396,97465,266,14756,796,0001,095,0002,113,536
8May 15, 2026 10:397,12366,288,15858,106,0001,020,0002,113,536
9May 15, 2026 10:397,13767,999,06158,234,0001,011,0002,113,536