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 8, 2025 16:59Dmytro OvcharenkoDmytro OvcharenkoScore: 69,081Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 8, 2025 16:5969,052598,223,957573,130,00002,383,872
2May 8, 2025 16:5969,060598,686,059572,202,0001,000,0002,383,872
3May 8, 2025 16:5969,067599,840,920572,255,0001,000,0002,256,896
4May 8, 2025 16:5969,077600,737,898572,340,0001,000,0002,375,680
5May 8, 2025 16:5969,081601,150,273572,369,0001,000,0002,506,752
6May 8, 2025 16:5969,082600,624,182572,378,0001,000,0002,256,896
7May 8, 2025 16:5969,086603,195,684572,417,0001,000,0002,256,896
8May 8, 2025 16:5969,104597,568,134573,566,00002,260,992
9May 8, 2025 16:5969,105604,166,669571,576,0001,998,0002,260,992