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 23:38emily graceemily graceScore: 70,195Success
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 23:3869,90850,663,29423,877,0001,989,0002,269,184
2Apr 18, 2025 23:3770,07848,576,84824,932,000997,0002,289,664
3Apr 18, 2025 23:3770,11954,996,93123,949,0001,995,0002,289,664
4Apr 18, 2025 23:3870,19548,210,51623,975,0001,997,0002,387,968
5Apr 18, 2025 23:3770,48150,306,94925,075,0001,003,0002,289,664
6Apr 18, 2025 23:3870,55953,713,44325,103,0001,004,0002,289,664