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 25, 2025 12:31VladislavVladislavScore: 204,262Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2025 12:31201,6931,703,979,3201,673,053,000999,0002,273,280
2Aug 25, 2025 12:31201,7531,700,063,0091,673,553,000999,0002,260,992
3Aug 25, 2025 12:31201,9171,702,900,4581,674,912,000999,0002,277,376
4Aug 25, 2025 12:31204,2331,719,073,1901,693,136,0001,998,0002,260,992
5Aug 25, 2025 12:31204,2621,720,104,8861,694,374,000999,0002,265,088
6Aug 25, 2025 12:31204,2761,719,095,7341,693,488,0001,999,0002,510,848
7Aug 25, 2025 12:31204,3271,723,125,8381,693,919,0001,998,0002,285,568
8Aug 25, 2025 12:31204,3531,718,864,2281,694,132,0001,998,0002,523,136
9Aug 25, 2025 12:31204,3851,723,412,0961,696,398,00002,285,568