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 15, 2025 23:50emily graceemily graceScore: 110,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2025 23:50109,43563,138,48139,479,0001,012,0002,289,664
2Apr 15, 2025 23:50110,63567,188,19139,937,000998,0002,289,664
3Apr 15, 2025 23:50110,68960,351,75538,958,0001,997,0002,289,664
4Apr 15, 2025 23:50110,73869,029,30438,975,0001,998,0002,289,664
5Apr 15, 2025 23:50110,97064,647,48539,057,0002,002,0002,277,376
6Apr 15, 2025 23:50111,00562,264,50640,071,0001,001,0002,289,664
7Apr 15, 2025 23:50111,20864,208,66940,144,0001,003,0002,265,088
8Apr 15, 2025 23:50111,30362,100,37639,174,0002,008,0002,359,296
9Apr 15, 2025 23:50111,40368,173,48739,209,0002,010,0002,269,184