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:24AnSaAnSaScore: 72,773Success
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:2472,54953,531,79224,855,0001,988,0002,273,280
2Jul 24, 2024 17:2472,55756,647,30124,858,0001,988,0002,281,472
3Jul 24, 2024 17:2472,57352,543,89624,863,0001,989,0002,265,088
4Jul 24, 2024 17:2472,61152,480,04424,876,0001,990,0002,269,184
5Jul 24, 2024 17:2472,61958,629,31723,884,0002,985,0002,277,376
6Jul 24, 2024 17:2472,76254,140,21124,928,0001,994,0002,277,376
7Jul 24, 2024 17:2472,77353,980,35022,937,0003,989,0002,277,376
8Jul 24, 2024 17:2472,78952,527,05423,940,0002,992,0002,277,376
9Jul 24, 2024 17:2472,90550,860,09624,977,0001,998,0002,281,472
10Jul 24, 2024 17:2477,24393,451,33928,579,97202,265,088
11Jul 24, 2024 17:2477,38685,332,35128,632,89302,260,992
12Jul 24, 2024 17:2477,87794,708,75328,814,65202,265,088