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 27, 2024 00:23Joad NacerJoad NacerScore: 78,133Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 27, 2024 00:2377,843107,755,83928,801,91602,256,896
2May 27, 2024 00:2378,13382,417,41228,909,13002,265,088
3May 27, 2024 00:2379,21886,722,54529,310,72102,269,184