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 24, 2026 20:23Victor MerckléVictor MerckléScore: 15,328Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 20:2415,326135,036,451126,160,0001,052,0002,113,536
2May 24, 2026 20:2415,327135,046,482126,155,0001,062,0002,113,536
3May 24, 2026 20:2415,327137,045,152126,158,0001,063,0002,113,536
4May 24, 2026 20:2415,327135,000,293126,154,0001,065,0002,113,536
5May 24, 2026 20:2415,328135,117,483126,166,0001,057,0002,113,536
6May 24, 2026 20:2415,331135,046,396126,190,0001,059,0002,113,536
7May 24, 2026 20:2415,334135,108,343126,199,0001,075,0002,113,536
8May 24, 2026 20:2415,336137,559,907126,214,0001,079,0002,113,536
9May 24, 2026 20:2415,355135,277,685126,417,0001,036,0002,113,536