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 6, 2026 20:55Kevin HeaveyKevin HeaveyScore: 15,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 20:5715,913141,565,646130,950,0001,134,0002,117,632
2Jul 6, 2026 20:5715,914141,691,007130,956,0001,134,0002,117,632
3Jul 6, 2026 20:5715,916141,694,618130,979,0001,125,0002,117,632
4Jul 6, 2026 20:5715,918141,674,888130,986,0001,139,0002,117,632
5Jul 6, 2026 20:5715,921141,678,594131,006,0001,139,0002,117,632
6Jul 6, 2026 20:5715,932141,894,700131,096,0001,146,0002,117,632
7Jul 6, 2026 20:5715,934141,831,202131,052,0001,203,0002,117,632
8Jul 6, 2026 20:5716,186143,898,783133,210,0001,139,0002,117,632
9Jul 6, 2026 20:5716,319145,007,697134,446,0001,008,0002,117,632