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 02:13Steve BronderSteve BronderScore: 189,632Success
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 02:13186,35192,235,99067,951,000999,0002,441,216
2Apr 21, 2025 02:13189,63290,140,20469,162,0001,002,0002,437,120
3Apr 21, 2025 02:13190,54992,916,87069,496,0001,007,0002,527,232