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 04:08Victor MerckléVictor MerckléScore: 6,958Success
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 04:086,94965,342,69656,671,0001,008,0002,113,536
2May 16, 2026 04:086,95066,682,07156,676,0001,014,0002,113,536
3May 16, 2026 04:086,95268,420,31556,679,0001,023,0002,113,536
4May 16, 2026 04:086,95468,196,50656,692,0001,034,0002,113,536
5May 16, 2026 04:086,95867,359,05856,738,0001,018,0002,113,536
6May 16, 2026 04:086,95865,626,40756,747,0001,006,0002,113,536
7May 16, 2026 04:086,97067,137,16056,718,0001,140,0002,113,536
8May 16, 2026 04:087,00866,463,22257,146,0001,024,0002,113,536
9May 16, 2026 04:087,08166,125,82957,775,0001,005,0002,113,536