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 listFeb 16, 2026 08:57wnwnScore: 8,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 08:577,28188,449,02855,395,0005,035,0002,318,336
2Feb 16, 2026 08:577,32587,007,08956,814,0003,986,0002,420,736
3Feb 16, 2026 08:577,57590,537,05157,886,0004,990,0002,330,624
4Feb 16, 2026 08:578,44094,071,04465,045,0005,003,0002,367,488
5Feb 16, 2026 08:578,47098,092,46564,277,0006,026,0002,437,120
6Feb 16, 2026 09:168,47397,143,51367,312,0003,014,0002,330,624
7Feb 16, 2026 09:168,48794,874,62466,419,0004,025,0002,342,912
8Feb 16, 2026 08:578,58493,378,90065,228,0006,021,0002,355,200
9Feb 16, 2026 09:168,75299,158,90266,586,0006,053,0002,351,104