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 00:23Christopher MullinsChristopher MullinsScore: 248,638Success
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 00:23248,5262,088,753,8242,059,764,0002,998,0002,482,176
2Dec 22, 2024 00:23248,5432,091,081,6562,060,912,0001,998,0002,322,432
3Dec 22, 2024 00:23248,6082,092,001,3762,062,447,000999,0002,322,432
4Dec 22, 2024 00:23248,6262,091,828,3272,061,600,0001,999,0002,322,432
5Dec 22, 2024 00:23248,6382,093,146,5222,058,703,0004,996,0002,486,272
6Dec 22, 2024 00:23248,6422,090,956,2192,060,733,0002,998,0002,322,432
7Dec 22, 2024 00:23248,6692,089,603,5112,060,954,0002,998,0002,322,432
8Dec 22, 2024 00:23248,6892,099,953,8102,061,119,0002,998,0002,322,432
9Dec 22, 2024 00:23248,7762,097,248,3662,062,844,0001,998,0002,473,984