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 22, 2025 20:31hunaphuhunaphuScore: 75,661Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 20:3175,659657,762,279625,972,0001,999,0002,273,280
2Dec 22, 2025 20:3175,660654,153,126625,977,0001,999,0002,387,968
3Dec 22, 2025 20:3175,660654,658,113625,980,0001,999,0002,400,256
4Dec 22, 2025 20:3175,660649,341,494627,982,00002,281,472
5Dec 22, 2025 20:3175,661651,088,322625,991,0001,999,0002,281,472
6Dec 22, 2025 20:3175,671650,206,714628,070,00002,273,280
7Dec 22, 2025 20:3175,672655,692,665627,080,0001,000,0002,273,280
8Dec 22, 2025 20:3175,673648,765,189627,088,0001,000,0002,273,280
9Dec 22, 2025 20:3175,731656,867,977627,568,000999,0002,273,280