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 listJul 23, 2026 16:11Kasper KivimäkiKasper KivimäkiScore: 59,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 16:1259,237501,385,349490,595,0001,074,0002,113,536
2Jul 23, 2026 16:1259,249501,447,760490,760,0001,010,0002,113,536
3Jul 23, 2026 16:1259,253501,498,310490,789,0001,012,0002,113,536
4Jul 23, 2026 16:1259,271501,690,137490,849,0001,103,0002,113,536
5Jul 23, 2026 16:1259,292502,542,640490,969,0001,162,0002,113,536
6Jul 23, 2026 16:1259,294501,946,689491,050,0001,095,0002,113,536
7Jul 23, 2026 16:1259,301501,958,509491,137,0001,069,0002,113,536
8Jul 23, 2026 16:1259,314502,196,594491,183,0001,130,0002,113,536
9Jul 23, 2026 16:1259,326502,150,729491,337,0001,071,0002,113,536