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 listAug 8, 2025 21:11Leon ZhaoLeon ZhaoScore: 17,679Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 8, 2025 21:1117,631172,945,099144,330,0002,004,0002,285,568
2Aug 8, 2025 21:1117,661173,264,562145,590,000997,0002,285,568
3Aug 8, 2025 21:1117,665174,769,492146,621,00002,478,080
4Aug 8, 2025 21:1117,676173,086,364144,713,0001,996,0002,285,568
5Aug 8, 2025 21:1117,679171,767,640145,738,000998,0002,285,568
6Aug 8, 2025 21:1117,680178,447,097144,752,0001,996,0002,285,568
7Aug 8, 2025 21:1117,682171,845,780143,768,0002,995,0002,285,568
8Aug 8, 2025 21:1117,685171,631,589144,791,0001,997,0002,285,568
9Aug 8, 2025 21:1117,919174,791,483146,733,0001,996,0002,330,624