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 13, 2026 15:13Victor MerckléVictor MerckléScore: 60,716Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 15:1459,986505,868,645493,130,0004,762,0002,113,536
2May 13, 2026 15:1460,104506,570,277493,984,0004,884,0002,113,536
3May 13, 2026 15:1460,653512,924,961498,691,0004,730,0002,113,536
4May 13, 2026 15:1460,671512,984,016498,760,0004,813,0002,113,536
5May 13, 2026 15:1460,716513,456,962499,015,0004,931,0002,113,536
6May 13, 2026 15:1460,925514,400,104500,864,0004,820,0002,113,536
7May 13, 2026 15:1460,925516,817,911500,830,0004,855,0002,113,536
8May 13, 2026 15:1461,327519,974,912504,381,0004,635,0002,113,536
9May 13, 2026 15:1462,491526,229,066514,041,0004,637,0002,113,536