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 listAug 6, 2022 19:11Franek KortaFranek KortaScore: 79,032Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2022 19:1178,886104,595,76929,187,66402,256,896
2Aug 6, 2022 19:1179,032108,844,89929,241,99402,265,088
3Aug 6, 2022 19:1179,323110,303,07129,349,44802,269,184