TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listFeb 22, 2024 02:33Huy Duc LeHuy Duc LeScore: 92,881Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2024 02:3391,62759,786,80731,908,0001,994,0002,527,232
2Feb 22, 2024 02:3391,91458,537,88632,008,0002,000,0002,281,472
3Feb 22, 2024 02:3392,00858,455,57232,041,0002,002,0002,281,472
4Feb 22, 2024 02:3392,24957,322,65732,125,0002,007,0002,281,472
5Feb 22, 2024 02:3392,44356,856,02732,192,0002,012,0002,281,472
6Feb 22, 2024 02:3392,56258,996,63632,234,0002,014,0002,281,472
7Feb 22, 2024 02:3392,88159,597,90233,356,0001,010,0002,281,472
8Feb 22, 2024 02:3393,10861,705,76332,424,0002,026,0002,281,472
9Feb 22, 2024 02:3393,12455,052,52931,416,0003,040,0002,281,472
10Feb 22, 2024 02:3395,929120,517,84335,493,67902,265,088
11Feb 22, 2024 02:3397,202106,902,34935,964,87702,265,088
12Feb 22, 2024 02:3398,132104,824,63236,308,70302,260,992