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 17:49Joad NacerJoad NacerScore: 59,649Success
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 17:4959,63043,709,94621,061,0001,002,0002,441,216
2Nov 28, 2024 17:4959,64945,276,93421,067,0001,003,0002,531,328
3Nov 28, 2024 17:4959,77044,292,21521,110,0001,005,0002,433,024