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 7, 2026 04:05wnwnScore: 3,304Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 04:57Victor Mercklé10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 04:123,28835,264,61926,266,0001,031,0002,113,536
2Jul 7, 2026 04:123,29435,353,17526,335,0001,011,0002,113,536
3Jul 7, 2026 04:123,29535,244,70426,326,0001,028,0002,113,536
4Jul 7, 2026 04:123,29535,525,68826,340,0001,012,0002,113,536
5Jul 7, 2026 04:123,30435,264,32926,424,0001,003,0002,113,536
6Jul 7, 2026 04:123,44036,559,63227,532,0001,027,0002,113,536
7Jul 7, 2026 04:123,46340,645,21527,707,0001,039,0002,113,536
8Jul 7, 2026 04:123,47436,660,54027,800,0001,039,0002,113,536
9Jul 7, 2026 04:123,51337,449,02028,148,0001,016,0002,113,536