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 5, 2026 20:26Kevin HeaveyKevin HeaveyScore: 168,976Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 20:27168,3501,407,008,0171,395,282,0002,028,0002,121,728stderr
2Jul 5, 2026 20:27168,5981,409,000,6151,398,349,0001,018,0002,121,728stderr
3Jul 5, 2026 20:27168,6441,409,482,6461,397,711,0002,036,0002,121,728stderr
4Jul 5, 2026 20:27168,9391,411,941,9031,401,194,0001,002,0002,121,728stderr
5Jul 5, 2026 20:27168,9761,412,116,3711,401,500,0001,007,0002,121,728stderr
6Jul 5, 2026 20:27169,2411,414,465,9721,403,705,0001,001,0002,121,728stderr
7Jul 5, 2026 20:27169,4461,416,077,7651,405,408,0001,000,0002,121,728stderr
8Jul 5, 2026 20:27169,6251,417,591,6901,406,886,0001,004,0002,121,728stderr
9Jul 5, 2026 20:27170,3581,423,548,2081,412,975,0001,003,0002,121,728stderr