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 2, 2026 10:29Victor MerckléVictor MerckléScore: 4,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 10:304,25943,062,25634,257,0001,094,0002,117,632stderr
2Jul 2, 2026 10:304,26443,174,95634,293,0001,102,0002,117,632stderr
3Jul 2, 2026 10:304,26943,153,65234,326,0001,114,0002,117,632stderr
4Jul 2, 2026 10:304,27443,199,12634,368,0001,108,0002,117,632stderr
5Jul 2, 2026 10:304,27643,224,42434,394,0001,099,0002,117,632stderr
6Jul 2, 2026 10:304,28243,271,72134,441,0001,101,0002,117,632stderr
7Jul 2, 2026 10:304,28643,392,41834,480,0001,096,0002,117,632stderr
8Jul 2, 2026 10:304,32643,596,16534,899,0001,010,0002,117,632stderr
9Jul 2, 2026 10:304,41944,493,81935,644,0001,037,0002,117,632stderr