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 24, 2024 17:45AnSaAnSaScore: 86,835Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2024 17:4586,17657,185,00029,893,0001,992,0002,277,376
2Jul 24, 2024 17:4586,18455,039,97729,895,0001,993,0002,277,376
3Jul 24, 2024 17:4586,19556,772,40029,899,0001,993,0002,277,376
4Jul 24, 2024 17:4586,71158,949,82228,073,0004,010,0002,277,376
5Jul 24, 2024 17:4586,79250,124,14330,106,0002,007,0002,277,376
6Jul 24, 2024 17:4586,79758,468,75031,112,0001,003,0002,281,472
7Jul 24, 2024 17:4586,83554,292,44831,125,0001,004,0002,277,376
8Jul 24, 2024 17:4587,02755,745,86930,188,0002,012,0002,277,376
9Jul 24, 2024 17:4587,15761,378,17430,233,0002,015,0002,277,376
10Jul 24, 2024 17:4592,019101,809,93934,046,90402,265,088
11Jul 24, 2024 17:4592,031102,132,12834,051,61002,269,184
12Jul 24, 2024 17:4592,241102,506,17334,129,20802,265,088