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:10Joad NacerJoad NacerScore: 59,754Success
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:1059,52751,292,46521,024,0001,001,0002,531,328
2Nov 28, 2024 19:1059,66847,880,91321,074,0001,003,0002,428,928
3Nov 28, 2024 19:1059,70544,429,09121,087,0001,004,0002,531,328
4Nov 28, 2024 19:1059,75445,971,17022,109,00002,531,328
5Nov 28, 2024 19:1059,78644,301,95721,116,0001,005,0002,433,024
6Nov 28, 2024 19:1059,87049,331,85621,146,0001,006,0002,531,328