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 17:54Victor MerckléVictor MerckléScore: 4,596Success
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 17:554,58446,144,36736,996,0001,059,0002,113,536
2May 24, 2026 17:554,58647,654,56436,998,0001,073,0002,113,536
3May 24, 2026 17:554,59046,196,15237,008,0001,097,0002,113,536
4May 24, 2026 17:554,59149,062,20037,036,0001,077,0002,113,536
5May 24, 2026 17:554,59646,784,15537,078,0001,069,0002,113,536
6May 24, 2026 17:554,59647,807,52137,071,0001,077,0002,113,536
7May 24, 2026 17:554,61648,813,63937,235,0001,080,0002,113,536
8May 24, 2026 17:554,63948,252,60937,498,0001,006,0002,113,536
9May 24, 2026 17:554,73349,288,43338,282,0001,008,0002,113,536