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 29, 2023 20:39Franek KortaFranek KortaScore: 68,639Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2023 20:3968,47376,063,07025,335,12002,289,664
2Aug 29, 2023 20:3968,63986,327,76425,396,51502,281,472
3Aug 29, 2023 20:3968,99591,031,37725,528,27102,281,472