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 16:52emily graceemily graceScore: 71,849Success
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 16:5271,21453,729,49124,323,0002,026,0002,289,664
2Apr 18, 2025 16:5271,34353,083,99226,397,00002,289,664
3Apr 18, 2025 16:5271,60848,525,08924,457,0002,038,0002,289,664
4Apr 18, 2025 16:5271,79551,037,93825,543,0001,021,0002,289,664
5Apr 18, 2025 16:5271,84952,568,41125,562,0001,022,0002,289,664
6Apr 18, 2025 16:5271,88653,380,38425,575,0001,023,0002,289,664
7Apr 18, 2025 16:5272,03852,960,26326,654,00002,289,664
8Apr 18, 2025 16:5272,52754,037,51525,842,000993,0002,355,200
9Apr 18, 2025 16:5272,62751,150,51325,877,000995,0002,289,664