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 22, 2023 14:59KiratKiratScore: 21,263,506Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 22, 2023 14:5921,226,5457,908,291,6687,853,821,60102,277,376
2Sep 22, 2023 14:5921,263,5067,943,534,9217,867,497,27602,277,376
3Sep 22, 2023 14:5921,273,8747,935,835,7497,871,333,48302,277,376