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 listJun 26, 2026 12:04Victor MerckléVictor MerckléScore: 4,330Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 12:054,25142,870,52034,191,0001,098,0002,113,536
2Jun 26, 2026 12:054,26843,155,00534,423,0001,009,0002,113,536
3Jun 26, 2026 12:054,28043,145,85734,517,0001,007,0002,113,536
4Jun 26, 2026 12:054,29243,227,78934,604,0001,025,0002,113,536
5Jun 26, 2026 12:054,33043,479,04234,916,0001,031,0002,113,536
6Jun 26, 2026 12:054,36543,720,18435,147,0001,090,0002,113,536
7Jun 26, 2026 12:054,38044,419,73735,262,0001,096,0002,113,536
8Jun 26, 2026 12:054,38143,991,95035,361,0001,007,0002,113,536
9Jun 26, 2026 12:054,39744,339,79035,492,0001,010,0002,113,536