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:08AnSaAnSaScore: 71,997Success
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:0871,26247,169,24923,325,0003,042,0002,523,136
2Jul 24, 2024 17:0871,40848,684,13124,389,0002,032,0002,277,376
3Jul 24, 2024 17:0871,55946,234,58026,477,00002,367,488
4Jul 24, 2024 17:0871,65453,193,71522,434,0004,078,0002,523,136
5Jul 24, 2024 17:0871,74147,777,53624,503,0002,041,0002,363,392
6Jul 24, 2024 17:0871,83055,275,10625,555,0001,022,0002,523,136
7Jul 24, 2024 17:0871,99755,513,21825,615,0001,024,0002,277,376
8Jul 24, 2024 17:0872,03552,541,71525,628,0001,025,0002,277,376
9Jul 24, 2024 17:0872,12257,471,76424,633,0002,052,0002,277,376
10Jul 24, 2024 17:0876,558105,043,09928,326,45202,265,088
11Jul 24, 2024 17:0876,731102,121,97928,390,35002,269,184
12Jul 24, 2024 17:0877,274105,890,29428,591,50602,269,184