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:33Victor MerckléVictor MerckléScore: 6,996Success
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:356,98867,184,58356,980,0001,025,0002,113,536
2May 16, 2026 00:356,99065,809,37157,010,0001,008,0002,113,536
3May 16, 2026 00:356,99067,033,74556,999,0001,020,0002,113,536
4May 16, 2026 00:356,99267,457,18056,996,0001,044,0002,113,536
5May 16, 2026 00:356,99666,374,00057,060,0001,012,0002,113,536
6May 16, 2026 00:357,00065,614,82157,065,0001,036,0002,113,536
7May 16, 2026 00:357,03967,519,20858,424,00002,113,536
8May 16, 2026 00:357,12068,365,45758,085,0001,016,0002,113,536
9May 16, 2026 00:357,14468,656,71558,288,0001,009,0002,113,536