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 listDec 30, 2025 08:52Mark R BestMark R BestScore: 51,945Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2025 08:5251,912462,562,352430,872,00002,371,584
2Dec 30, 2025 08:5251,932451,387,959430,034,0001,000,0002,285,568
3Dec 30, 2025 08:5251,933455,980,140430,043,0001,000,0002,285,568
4Dec 30, 2025 08:5251,937459,174,913431,080,00002,285,568
5Dec 30, 2025 08:5251,945463,337,098431,143,00002,367,488
6Dec 30, 2025 08:5251,950452,505,232431,189,00002,285,568
7Dec 30, 2025 08:5251,958452,314,288431,249,00002,285,568
8Dec 30, 2025 08:5251,963460,924,124431,293,00002,285,568
9Dec 30, 2025 08:5251,967453,339,037430,324,0001,000,0002,285,568