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 14, 2026 14:21Jarry XiaoJarry XiaoScore: 11,291Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 14:2111,186102,484,96791,832,0001,017,0002,121,728stderr
2Jul 14, 2026 14:2111,276103,184,73092,580,0001,018,0002,121,728stderr
3Jul 14, 2026 14:2111,280103,189,85592,614,0001,016,0002,121,728stderr
4Jul 14, 2026 14:2111,289103,480,11492,687,0001,015,0002,121,728stderr
5Jul 14, 2026 14:2111,291103,309,16592,701,0001,017,0002,121,728stderr
6Jul 14, 2026 14:2111,293103,375,51492,722,0001,016,0002,121,728stderr
7Jul 14, 2026 14:2111,298103,404,46592,763,0001,017,0002,121,728stderr
8Jul 14, 2026 14:2111,311103,507,04092,868,0001,016,0002,121,728stderr
9Jul 14, 2026 14:2113,475121,439,656110,833,0001,014,0002,121,728stderr