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:38Matthew SillsMatthew SillsScore: 90,962Success
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:3890,33056,328,31532,410,0001,012,0002,289,664
2Jul 28, 2024 17:3890,61955,718,76732,513,0001,016,0002,289,664
3Jul 28, 2024 17:3890,61959,188,05632,513,0001,016,0002,289,664
4Jul 28, 2024 17:3890,75761,555,80232,563,0001,017,0002,289,664
5Jul 28, 2024 17:3890,79761,664,00432,577,0001,018,0002,289,664
6Jul 28, 2024 17:3890,84656,862,10532,595,0001,018,0002,289,664
7Jul 28, 2024 17:3890,96259,800,28833,656,00002,273,280
8Jul 28, 2024 17:3890,97362,730,65632,640,0001,020,0002,289,664
9Jul 28, 2024 17:3891,11660,925,27032,692,0001,021,0002,289,664
10Jul 28, 2024 17:3894,10099,475,89034,817,00902,273,280
11Jul 28, 2024 17:3894,47898,891,69334,956,95802,269,184
12Jul 28, 2024 17:3895,913103,490,83235,487,99302,260,992