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:08Christopher MullinsChristopher MullinsScore: 252,332Success
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:08252,1362,117,699,0282,090,730,0001,998,0002,322,432
2Dec 22, 2024 00:08252,1452,125,009,2572,090,806,0001,998,0002,469,888
3Dec 22, 2024 00:08252,3252,123,234,6452,092,297,0001,998,0002,322,432
4Dec 22, 2024 00:08252,3312,126,939,0882,091,352,0002,999,0002,322,432
5Dec 22, 2024 00:08252,3322,124,776,9022,093,358,000999,0002,322,432
6Dec 22, 2024 00:08252,3352,125,150,2942,090,387,0003,996,0002,461,696
7Dec 22, 2024 00:08252,3702,129,273,5322,091,672,0002,998,0002,322,432
8Dec 22, 2024 00:08252,4112,128,103,1852,092,015,0002,998,0002,322,432
9Dec 22, 2024 00:08263,2462,212,890,7222,183,942,000999,0002,322,432