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 24, 2026 14:42Victor MerckléVictor MerckléScore: 14,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 14:4314,601129,715,902120,123,0001,072,0002,113,536
2May 24, 2026 14:4314,611129,096,560120,178,0001,099,0002,113,536
3May 24, 2026 14:4314,612129,139,675120,221,0001,065,0002,113,536
4May 24, 2026 14:4314,614132,255,145120,232,0001,072,0002,113,536
5May 24, 2026 14:4314,624129,735,816120,303,0001,078,0002,113,536
6May 24, 2026 14:4314,631129,200,707120,363,0001,081,0002,113,536
7May 24, 2026 14:4314,636129,375,056120,474,0001,009,0002,113,536
8May 24, 2026 14:4314,637130,726,650120,427,0001,062,0002,113,536
9May 24, 2026 14:4314,662129,546,388120,637,0001,065,0002,113,536