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:13Victor MerckléVictor MerckléScore: 6,954Success
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:146,94867,548,35657,676,00002,113,536
2May 16, 2026 00:146,94967,194,70257,682,00002,113,536
3May 16, 2026 00:146,95165,153,13857,698,00002,113,536
4May 16, 2026 00:146,95266,360,42656,685,0001,019,0002,113,536
5May 16, 2026 00:146,95465,342,53356,711,0001,009,0002,113,536
6May 16, 2026 00:146,96765,095,26856,804,0001,030,0002,113,536
7May 16, 2026 00:147,00165,984,45758,115,00002,113,536
8May 16, 2026 00:147,00966,206,98957,146,0001,035,0002,113,536
9May 16, 2026 00:147,09968,119,64057,916,0001,007,0002,113,536