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 13, 2026 23:17Victor MerckléVictor MerckléScore: 7,568Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 23:177,56570,542,28562,796,00002,113,536
2May 13, 2026 23:177,56571,036,20762,795,00002,113,536
3May 13, 2026 23:177,56570,285,22662,794,00002,113,536
4May 13, 2026 23:177,56670,899,30262,806,00002,113,536
5May 13, 2026 23:177,56871,926,40662,821,00002,113,536
6May 13, 2026 23:177,57472,188,76761,851,0001,018,0002,113,536
7May 13, 2026 23:177,61570,870,83662,165,0001,047,0002,113,536
8May 13, 2026 23:177,62172,260,01162,219,0001,040,0002,113,536
9May 13, 2026 23:177,70471,181,69462,942,0001,003,0002,113,536