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 listDec 22, 2024 08:22Christopher MullinsChristopher MullinsScore: 134,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2024 08:22133,9381,142,724,7871,108,687,0002,999,0002,482,176
2Dec 22, 2024 08:22133,9961,140,764,7471,111,167,0001,000,0002,322,432
3Dec 22, 2024 08:22134,0111,139,847,2031,109,291,0002,998,0002,478,080
4Dec 22, 2024 08:22134,0261,142,924,2091,109,414,0002,998,0002,478,080
5Dec 22, 2024 08:22134,1051,141,477,3511,112,069,0001,000,0002,322,432
6Dec 22, 2024 08:22134,1091,135,359,5071,111,107,0001,998,0002,322,432
7Dec 22, 2024 08:22134,1471,142,493,4701,111,418,0001,998,0002,322,432
8Dec 22, 2024 08:22134,1501,141,516,9121,109,447,0003,998,0002,322,432
9Dec 22, 2024 08:22134,1661,145,110,2051,110,582,0002,998,0002,322,432