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 listApr 21, 2025 05:02Steve BronderSteve BronderScore: 74,124Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2025 05:0273,98153,658,52225,346,0002,027,0002,269,184
2Apr 21, 2025 05:0274,12449,578,21627,426,00002,428,928
3Apr 21, 2025 05:0274,33249,499,96526,485,0001,018,0002,527,232