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 listAug 16, 2025 15:34Aniruddha DebAniruddha DebScore: 65,473Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2025 15:3465,27052,572,69822,138,0002,012,0002,428,928
2Aug 16, 2025 15:3465,32741,301,35823,164,0001,007,0002,428,928
3Aug 16, 2025 15:3465,33248,206,93922,159,0002,014,0002,269,184
4Aug 16, 2025 15:3465,39545,868,07423,188,0001,008,0002,531,328
5Aug 16, 2025 15:3465,47342,667,26623,216,0001,009,0002,424,832
6Aug 16, 2025 15:3465,57849,729,43524,264,00002,269,184
7Aug 16, 2025 15:3465,72255,438,17424,317,00002,428,928
8Aug 16, 2025 15:3465,81151,393,57524,350,00002,412,544
9Aug 16, 2025 15:3466,04644,072,65023,419,0001,018,0002,531,328