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 listSep 11, 2021 07:01Sergey StreminSergey StreminScore: 156,876Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2021 07:01155,874131,844,08657,673,54202,232,320
2Sep 11, 2021 07:01156,876123,280,30858,044,22102,199,552
3Sep 11, 2021 07:01165,304128,112,52661,162,50702,289,664