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 22, 2025 20:52Steve BronderSteve BronderScore: 68,703Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2025 20:5268,63246,374,17824,379,0001,015,0002,539,520
2Apr 22, 2025 20:5268,70352,094,53324,404,0001,016,0002,277,376
3Apr 22, 2025 20:5268,98147,171,11825,523,00002,539,520