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 24, 2026 20:17Kevin HeaveyKevin HeaveyScore: 3,802Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2026 20:183,5661,039,565,11828,548,0001,051,0002,113,536
2Jul 24, 2026 20:183,6631,040,394,77729,346,0001,065,0002,113,536
3Jul 24, 2026 20:183,6781,040,579,38629,328,0001,201,0002,113,536
4Jul 24, 2026 20:183,7621,041,197,28230,047,0001,181,0002,113,536
5Jul 24, 2026 20:183,8021,041,583,44630,362,0001,200,0002,113,536
6Jul 24, 2026 20:183,8121,041,522,74130,600,0001,045,0002,113,536
7Jul 24, 2026 20:183,8241,042,120,57830,563,0001,177,0002,113,536
8Jul 24, 2026 20:183,8641,042,061,39530,890,0001,188,0002,113,536
9Jul 24, 2026 20:183,8991,048,125,30731,309,0001,053,0002,113,536