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:33Paul MasurelPaul MasurelScore: 168,010Success
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:33160,601125,838,23259,422,31302,301,952
2Jul 16, 2023 14:33168,010134,136,91562,163,68002,228,224
3Jul 16, 2023 14:33174,885125,952,96164,707,62802,203,648