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 listMay 7, 2024 23:19Joad NacerJoad NacerScore: 68,273Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2024 23:1968,116117,142,35225,202,78502,277,376
2May 7, 2024 23:1968,27392,360,23425,260,93402,281,472
3May 7, 2024 23:1969,04178,463,04925,545,14802,273,280