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 14:58Victor MerckléVictor MerckléScore: 4,722Success
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 14:594,71346,919,24138,047,0001,073,0002,113,536
2May 24, 2026 14:594,71446,995,78438,052,0001,077,0002,113,536
3May 24, 2026 14:594,71446,984,59138,039,0001,091,0002,113,536
4May 24, 2026 14:594,71547,288,05738,074,0001,063,0002,113,536
5May 24, 2026 14:594,72247,361,53338,134,0001,060,0002,113,536
6May 24, 2026 14:594,73447,458,73038,290,0001,004,0002,113,536
7May 24, 2026 14:594,74147,188,31238,288,0001,069,0002,113,536
8May 24, 2026 14:594,76049,860,43038,474,0001,034,0002,113,536
9May 24, 2026 14:594,76448,282,34538,536,0001,008,0002,113,536