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 12:25Victor MerckléVictor MerckléScore: 6,967Success
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 12:256,96265,217,31156,753,0001,033,0002,113,536
2May 15, 2026 12:256,96465,536,69056,803,0001,003,0002,113,536
3May 15, 2026 12:256,96465,468,43956,768,0001,041,0002,113,536
4May 15, 2026 12:256,96565,093,68757,814,00002,113,536
5May 15, 2026 12:256,96767,103,41456,827,0001,001,0002,113,536
6May 15, 2026 12:256,97666,540,11456,790,0001,116,0002,113,536
7May 15, 2026 12:257,01666,820,04458,234,00002,113,536
8May 15, 2026 12:257,02066,182,54858,266,00002,113,536
9May 15, 2026 12:257,07566,011,64957,726,0001,002,0002,113,536