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 17, 2026 16:17Kevin HeaveyKevin HeaveyScore: 3,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 16:183,65240,056,12929,271,0001,044,0002,117,632
2Jul 17, 2026 16:183,65840,180,50329,317,0001,051,0002,117,632
3Jul 17, 2026 16:183,66240,239,43629,349,0001,049,0002,117,632
4Jul 17, 2026 16:183,78341,166,59230,357,0001,042,0002,117,632
5Jul 17, 2026 16:183,84341,735,35130,851,0001,052,0002,117,632
6Jul 17, 2026 16:183,88041,994,75731,162,0001,043,0002,117,632
7Jul 17, 2026 16:183,88942,024,22031,245,0001,041,0002,117,632
8Jul 17, 2026 16:183,96542,711,47531,874,0001,040,0002,117,632
9Jul 17, 2026 16:183,98942,867,58832,067,0001,044,0002,117,632