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 listJun 29, 2026 08:13Victor MerckléVictor MerckléScore: 7,315Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 08:147,29468,313,98059,463,0001,080,0002,113,536
2Jun 29, 2026 08:147,30668,435,07459,576,0001,066,0002,113,536
3Jun 29, 2026 08:147,30768,474,60659,642,0001,009,0002,113,536
4Jun 29, 2026 08:147,31368,556,61859,677,0001,028,0002,113,536
5Jun 29, 2026 08:147,31568,527,71959,711,0001,007,0002,113,536
6Jun 29, 2026 08:147,31668,388,87359,690,0001,037,0002,113,536
7Jun 29, 2026 08:147,32568,673,76359,797,0001,001,0002,113,536
8Jun 29, 2026 08:147,35468,824,03460,032,0001,008,0002,113,536
9Jun 29, 2026 08:147,41169,389,76960,509,0001,003,0002,113,536