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 19:12Joad NacerJoad NacerScore: 59,676Success
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 19:1259,50846,922,69421,018,0001,000,0002,269,184
2Nov 28, 2024 19:1259,67643,094,00821,077,0001,003,0002,531,328
3Nov 28, 2024 19:1260,17650,224,32321,253,0001,012,0002,428,928