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 6, 2026 08:11Kevin HeaveyKevin HeaveyScore: 10,733Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 08:1310,55497,210,65882,320,0005,279,0002,121,728stderr
2Jul 6, 2026 08:1310,64597,864,04783,084,0005,274,0002,121,728stderr
3Jul 6, 2026 08:1310,68998,290,20383,368,0005,351,0002,121,728stderr
4Jul 6, 2026 08:1310,70398,321,12683,400,0005,440,0002,121,728stderr
5Jul 6, 2026 08:1310,73398,585,49983,857,0005,231,0002,121,728stderr
6Jul 6, 2026 08:1310,76398,880,84284,102,0005,238,0002,121,728stderr
7Jul 6, 2026 08:1310,81399,320,53884,416,0005,339,0002,121,728stderr
8Jul 6, 2026 08:1310,86699,728,20384,936,0005,259,0002,121,728stderr
9Jul 6, 2026 08:1310,880100,716,46985,045,0005,263,0002,121,728stderr