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 28, 2024 17:41Matthew SillsMatthew SillsScore: 86,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2024 17:4185,59258,463,85430,648,0001,021,0002,289,664
2Jul 28, 2024 17:4185,59556,846,68030,649,0001,021,0002,273,280
3Jul 28, 2024 17:4185,70362,154,40430,688,0001,022,0002,289,664
4Jul 28, 2024 17:4186,04358,002,55029,847,0001,989,0002,289,664
5Jul 28, 2024 17:4186,06263,676,84229,853,0001,990,0002,289,664
6Jul 28, 2024 17:4186,06860,056,59330,850,000995,0002,289,664
7Jul 28, 2024 17:4186,07658,841,75929,858,0001,990,0002,289,664
8Jul 28, 2024 17:4186,07658,027,99129,858,0001,990,0002,289,664
9Jul 28, 2024 17:4186,11461,578,84229,871,0001,991,0002,273,280
10Jul 28, 2024 17:4187,542101,133,16532,390,67802,277,376
11Jul 28, 2024 17:4189,684108,252,49433,183,22002,269,184
12Jul 28, 2024 17:4190,12796,346,16633,347,02202,277,376