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 listJul 16, 2023 14:57Paul MasurelPaul MasurelScore: 73,938Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2023 14:5773,901105,745,01827,343,54902,191,360
2Jul 16, 2023 14:5773,938101,403,22227,357,15802,195,456
3Jul 16, 2023 14:5786,80396,747,43132,117,21602,191,360