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:28Victor MerckléVictor MerckléScore: 7,046Success
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:297,03766,133,70857,318,0001,097,0002,113,536
2May 16, 2026 00:297,04067,899,55957,313,0001,119,0002,113,536
3May 16, 2026 00:297,04167,040,36957,332,0001,114,0002,113,536
4May 16, 2026 00:297,04268,238,54757,325,0001,128,0002,113,536
5May 16, 2026 00:297,04665,766,13957,359,0001,125,0002,113,536
6May 16, 2026 00:297,06267,248,53557,511,0001,104,0002,113,536
7May 16, 2026 00:297,06966,279,15057,551,0001,125,0002,113,536
8May 16, 2026 00:297,09468,124,48857,760,0001,123,0002,113,536
9May 16, 2026 00:297,18468,788,20158,536,0001,094,0002,113,536