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 listMay 15, 2026 19:34Victor MerckléVictor MerckléScore: 95,723Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 19:3595,123797,176,488784,096,0005,429,0002,121,728stderr
2May 15, 2026 19:3595,162798,869,375783,883,0005,968,0002,121,728stderr
3May 15, 2026 19:3595,227799,459,352784,643,0005,743,0002,121,728stderr
4May 15, 2026 19:3595,426801,491,009786,281,0005,763,0002,121,728stderr
5May 15, 2026 19:3595,723801,868,973788,545,0005,956,0002,121,728stderr
6May 15, 2026 19:3596,203808,143,249792,645,0005,841,0002,121,728stderr
7May 15, 2026 19:3596,263807,432,729793,477,0005,514,0002,121,728stderr
8May 15, 2026 19:3596,672809,636,857796,084,0006,295,0002,121,728stderr
9May 15, 2026 19:3597,065816,401,689798,926,0006,714,0002,121,728stderr