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 listNov 20, 2023 07:39AdrKAdrKScore: 21,354,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2023 07:3921,317,2657,955,528,7187,887,388,03502,277,376
2Nov 20, 2023 07:3921,354,4387,967,376,8347,901,141,91802,289,664
3Nov 20, 2023 07:3921,516,4148,028,771,6927,961,073,15202,285,568