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 27, 2024 17:43Matthew SillsMatthew SillsScore: 108,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2024 17:43107,13266,562,06739,639,00002,273,280
2Jul 27, 2024 17:43107,70365,455,67839,850,00002,433,024
3Jul 27, 2024 17:43107,71166,503,44839,853,00002,535,424
4Jul 27, 2024 17:43107,71467,799,86938,858,000996,0002,424,832
5Jul 27, 2024 17:43107,75165,228,49437,875,0001,993,0002,424,832
6Jul 27, 2024 17:43107,81961,781,52738,896,000997,0002,273,280
7Jul 27, 2024 17:43108,37060,998,00339,095,0001,002,0002,424,832
8Jul 27, 2024 17:43108,37361,784,07338,094,0002,004,0002,437,120
9Jul 27, 2024 17:43108,69563,188,92139,212,0001,005,0002,535,424
10Jul 27, 2024 17:43110,32993,905,85840,821,64702,256,896
11Jul 27, 2024 17:43111,112114,571,28441,111,54202,281,472
12Jul 27, 2024 17:43111,54899,486,27741,272,93102,277,376