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:21Steve BronderSteve BronderScore: 70,957Success
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:2170,80848,961,13925,192,0001,007,0002,510,848
2Apr 21, 2025 05:2170,95748,761,29725,245,0001,009,0002,437,120
3Apr 21, 2025 05:2171,46546,975,57524,408,0002,034,0002,527,232