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 listJan 3, 2026 16:56Carlos MGCarlos MGScore: 60,929Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 16:5660,792534,563,851503,578,000999,0002,527,232
2Jan 3, 2026 16:5660,854530,121,053504,088,0001,000,0002,293,760
3Jan 3, 2026 16:5660,921533,173,748503,650,0001,998,0002,523,136
4Jan 3, 2026 16:5660,929535,696,405503,712,0001,998,0002,519,040
5Jan 3, 2026 16:5660,929533,784,255503,716,0001,998,0002,351,104
6Jan 3, 2026 16:5660,938535,354,125504,786,000999,0002,293,760
7Jan 3, 2026 16:5660,964536,057,580504,004,0002,000,0002,531,328
8Jan 3, 2026 16:5660,969529,412,146504,046,0002,000,0002,265,088
9Jan 3, 2026 16:5661,028532,497,858504,535,0001,998,0002,285,568