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 20, 2025 15:00Drew GarciaDrew GarciaScore: 76,941Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2025 15:0076,72757,609,68026,362,0002,027,0002,289,664
2Apr 20, 2025 15:0076,94150,007,36728,468,00002,281,472
3Apr 20, 2025 15:0077,93856,523,23626,849,0001,988,0002,277,376