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:38Franek KortaFranek KortaScore: 156,115Success
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:38151,687112,129,21256,124,07402,252,800
2Aug 6, 2022 19:38156,115134,455,16257,762,70502,260,992
3Aug 6, 2022 19:38156,813134,485,05358,020,66202,265,088