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 listMar 23, 2025 17:25Alexander KosachevAlexander KosachevScore: 53,904Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2025 17:2553,852472,692,969445,970,000999,0002,486,272
2Mar 23, 2025 17:2553,881467,632,787446,213,0001,000,0002,527,232
3Mar 23, 2025 17:2553,885468,666,193447,242,00002,478,080
4Mar 23, 2025 17:2553,898480,814,130445,355,0002,001,0002,473,984
5Mar 23, 2025 17:2553,904481,810,356445,407,0001,997,0002,527,232
6Mar 23, 2025 17:2553,907477,552,755447,432,00002,527,232
7Mar 23, 2025 17:2553,932471,724,618443,639,0003,996,0002,482,176
8Mar 23, 2025 17:2553,935477,632,980447,663,00002,486,272
9Mar 23, 2025 17:2553,978469,668,767446,014,0002,000,0002,531,328