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 listJul 16, 2023 16:25Paul MasurelPaul MasurelScore: 71,389Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2023 16:2570,31152,274,43324,014,0002,001,0002,359,296
2Jul 16, 2023 16:2570,96848,881,13925,249,0001,009,0002,285,568
3Jul 16, 2023 16:2571,00047,384,15024,250,0002,020,0002,363,392
4Jul 16, 2023 16:2571,01951,478,18425,267,0001,010,0002,371,584
5Jul 16, 2023 16:2571,11947,449,41024,290,0002,024,0002,285,568
6Jul 16, 2023 16:2571,16556,141,84724,306,0002,025,0002,367,488
7Jul 16, 2023 16:2571,38953,679,46326,414,00002,285,568
8Jul 16, 2023 16:2571,44351,643,86325,418,0001,016,0002,363,392
9Jul 16, 2023 16:2571,54949,526,66125,455,0001,018,0002,285,568
10Jul 16, 2023 16:2573,130106,488,02627,057,92102,260,992
11Jul 16, 2023 16:2573,223110,281,97627,092,68902,203,648
12Jul 16, 2023 16:2574,01393,989,56527,384,69702,203,648