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 14:31Victor MerckléVictor MerckléScore: 4,164Success
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 14:324,15042,136,03233,320,0001,132,0002,125,824stderr
2Jun 29, 2026 14:324,15142,393,97733,309,0001,152,0002,125,824stderr
3Jun 29, 2026 14:324,15642,451,96733,347,0001,149,0002,125,824stderr
4Jun 29, 2026 14:324,16242,669,23433,398,0001,150,0002,125,824stderr
5Jun 29, 2026 14:324,16442,310,17233,434,0001,131,0002,125,824stderr
6Jun 29, 2026 14:324,17542,447,19133,591,0001,063,0002,125,824stderr
7Jun 29, 2026 14:324,17942,397,35033,554,0001,137,0002,125,824stderr
8Jun 29, 2026 14:324,18242,543,15533,625,0001,092,0002,125,824stderr
9Jun 29, 2026 14:324,36443,973,75535,153,0001,071,0002,125,824stderr