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 16, 2026 00:43Victor MerckléVictor MerckléScore: 6,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 00:446,94767,541,08256,632,0001,030,0002,113,536
2May 16, 2026 00:446,94867,849,28156,670,0001,001,0002,113,536
3May 16, 2026 00:446,94867,048,39656,670,0001,003,0002,113,536
4May 16, 2026 00:446,94965,136,64556,672,0001,006,0002,113,536
5May 16, 2026 00:446,95067,235,25356,662,0001,025,0002,113,536
6May 16, 2026 00:446,95067,007,49056,686,0001,004,0002,113,536
7May 16, 2026 00:446,95968,135,76356,732,0001,029,0002,113,536
8May 16, 2026 00:446,97166,195,03256,856,0001,006,0002,113,536
9May 16, 2026 00:447,01667,628,12158,235,00002,113,536