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:04Steve BronderSteve BronderScore: 75,289Success
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:0474,58455,234,69126,574,0001,022,0002,428,928
2Apr 21, 2025 05:0475,28960,735,87526,863,000994,0002,527,232
3Apr 21, 2025 05:0475,30358,636,19525,872,0001,990,0002,433,024