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:10Drew GarciaDrew GarciaScore: 75,335Success
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:1074,80854,153,15226,654,0001,025,0002,281,472
2Apr 20, 2025 16:1075,33552,022,58824,888,0002,986,0002,269,184
3Apr 20, 2025 16:1075,49751,684,70925,939,0001,995,0002,281,472