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 listSep 12, 2026 14:53Kevin HeaveyKevin HeaveyScore: 3,835Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 14:543,58938,621,11128,749,0001,042,0002,113,536
2Sep 12, 2026 14:543,76540,210,82730,135,0001,115,0002,113,536
3Sep 12, 2026 14:543,79740,372,74130,466,0001,050,0002,113,536
4Sep 12, 2026 14:543,82840,784,72130,741,0001,034,0002,113,536
5Sep 12, 2026 14:543,83541,050,66530,780,0001,058,0002,113,536
6Sep 12, 2026 14:543,84940,751,57730,772,0001,181,0002,113,536
7Sep 12, 2026 14:543,85540,818,79430,764,0001,233,0002,113,536
8Sep 12, 2026 14:543,85740,894,00030,951,0001,067,0002,113,536
9Sep 12, 2026 14:543,88141,115,44831,172,0001,041,0002,113,536