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:34Paul MasurelPaul MasurelScore: 73,659Success
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:3472,59553,403,84425,866,000994,0002,363,392
2Jul 16, 2023 16:3472,72253,668,10224,914,0001,993,0002,367,488
3Jul 16, 2023 16:3472,94350,417,03924,990,0001,999,0002,363,392
4Jul 16, 2023 16:3473,16253,224,38225,065,0002,005,0002,355,200
5Jul 16, 2023 16:3473,37059,156,70525,137,0002,010,0002,461,696
6Jul 16, 2023 16:3473,61649,474,82925,221,0002,017,0002,367,488
7Jul 16, 2023 16:3473,65992,688,90127,253,76902,318,336
8Jul 16, 2023 16:3473,72754,682,65525,259,0002,020,0002,363,392
9Jul 16, 2023 16:3473,828103,764,60227,316,29502,203,648
10Jul 16, 2023 16:3473,84957,363,60825,300,0002,024,0002,281,472
11Jul 16, 2023 16:3473,90048,910,13426,331,0001,012,0002,363,392
12Jul 16, 2023 16:3475,534102,636,29027,947,66802,199,552