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 20:07Joad NacerJoad NacerScore: 59,557Success
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 20:0759,52746,757,48621,024,0001,001,0002,424,832
2Nov 28, 2024 20:0759,55749,405,88920,033,0002,003,0002,424,832
3Nov 28, 2024 20:0759,82750,318,01421,130,0001,006,0002,424,832