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 11, 2025 17:11Ian MckibbenIan MckibbenScore: 12,360Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2025 17:1112,352122,350,909102,518,00002,428,928
2Aug 11, 2025 17:1112,357125,022,748102,563,00002,510,848
3Aug 11, 2025 17:1112,358131,727,879102,568,00002,531,328
4Aug 11, 2025 17:1112,358127,068,429102,574,00002,531,328
5Aug 11, 2025 17:1112,360129,899,821102,587,00002,531,328
6Aug 11, 2025 17:1112,363132,580,628102,614,00002,531,328
7Aug 11, 2025 17:1112,369129,645,466101,653,0001,006,0002,531,328
8Aug 11, 2025 17:1112,371128,120,320101,687,000996,0002,510,848
9Aug 11, 2025 17:1112,380127,733,034101,753,000997,0002,531,328