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 18, 2025 20:38Drew GarciaDrew GarciaScore: 82,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 20:3882,59558,127,24428,523,0002,037,0002,277,376
2Apr 18, 2025 20:3882,65457,979,67230,582,00002,281,472
3Apr 18, 2025 20:3882,74361,327,42929,595,0001,020,0002,281,472