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 listNov 12, 2024 11:44Kirill AndriianovKirill AndriianovScore: 129,057Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2024 11:44128,7411,090,010,8511,067,553,000999,0002,531,328
2Nov 12, 2024 11:44128,7431,092,120,5661,068,569,00002,535,424
3Nov 12, 2024 11:44128,7571,097,384,7791,068,686,00002,527,232
4Nov 12, 2024 11:44129,0391,096,340,9861,070,022,000999,0002,531,328
5Nov 12, 2024 11:44129,0571,094,330,3861,069,172,0001,998,0002,531,328
6Nov 12, 2024 11:44131,3631,119,094,1541,090,311,00002,527,232
7Nov 12, 2024 11:44131,3961,118,778,8901,088,585,0001,999,0002,535,424
8Nov 12, 2024 11:44131,4091,114,917,4571,089,697,000999,0002,486,272
9Nov 12, 2024 11:44132,1591,121,896,0241,096,923,00002,531,328