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 27, 2022 23:21apuxbtapuxbtScore: 6,116,129Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 27, 2022 23:216,109,1102,327,155,8922,260,370,80502,289,664
2Nov 27, 2022 23:216,116,1292,316,150,5852,262,967,55902,293,760
3Nov 27, 2022 23:216,123,4862,322,749,8652,265,689,79402,277,376