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 28, 2024 18:15Joad NacerJoad NacerScore: 61,459Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 28, 2024 18:1561,24152,493,69922,659,00002,433,024
2Nov 28, 2024 18:1561,45947,240,81921,707,0001,033,0002,428,928
3Nov 28, 2024 18:1561,74347,557,73622,845,00002,265,088