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 19, 2025 00:02emily graceemily graceScore: 69,897Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2025 00:0269,81458,512,99823,844,0001,987,0002,273,280
2Apr 19, 2025 00:0269,82455,649,87624,842,000993,0002,383,872
3Apr 19, 2025 00:0269,87057,559,15123,864,0001,988,0002,273,280
4Apr 19, 2025 00:0269,88950,228,40325,859,00002,273,280
5Apr 19, 2025 00:0269,89756,402,65423,873,0001,989,0002,527,232
6Apr 19, 2025 00:0269,95950,892,11323,894,0001,991,0002,277,376
7Apr 19, 2025 00:0270,15147,353,43823,960,0001,996,0002,277,376
8Apr 19, 2025 00:0270,23547,646,54223,988,0001,999,0002,269,184
9Apr 19, 2025 00:0270,41149,128,19524,048,0002,004,0002,269,184