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 13, 2024 14:36Dan StolyarovDan StolyarovScore: 302,900Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 13, 2024 14:36300,478133,432,33764,102,00047,075,0002,465,792
2Nov 13, 2024 14:36302,900136,587,94363,041,00049,032,0002,285,568
3Nov 13, 2024 14:36303,638136,205,18762,192,00050,154,0002,453,504