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 16:13Drew GarciaDrew GarciaScore: 79,168Success
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 16:1379,00055,043,52627,215,0002,015,0002,281,472
2Apr 20, 2025 16:1379,16857,018,52626,262,0003,030,0002,281,472
3Apr 20, 2025 16:1379,73250,632,72229,501,00002,273,280