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 03:00Kevin HeaveyKevin HeaveyScore: 3,725Success
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 03:053,66540,157,29129,374,0001,050,0002,113,536
2Jul 17, 2026 03:053,67840,301,45729,485,0001,050,0002,113,536
3Jul 17, 2026 03:053,69840,428,59729,645,0001,055,0002,113,536
4Jul 17, 2026 03:053,70940,536,60529,764,0001,028,0002,113,536
5Jul 17, 2026 03:053,72540,717,40829,874,0001,045,0002,113,536
6Jul 17, 2026 03:053,73240,762,71529,927,0001,050,0002,113,536
7Jul 17, 2026 03:053,90342,084,02431,342,0001,053,0002,113,536
8Jul 17, 2026 03:053,95243,711,72631,758,0001,047,0002,113,536
9Jul 17, 2026 03:054,00143,469,87432,169,0001,046,0002,113,536