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:24Matthew SillsMatthew SillsScore: 113,086Success
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:24111,93064,427,52340,404,0001,010,0002,289,664
2Jul 28, 2024 17:24112,27062,671,69040,527,0001,013,0002,269,184
3Jul 28, 2024 17:24112,48969,106,09140,606,0001,015,0002,273,280
4Jul 28, 2024 17:24112,50566,938,95639,645,0001,982,0002,277,376
5Jul 28, 2024 17:24112,996108,704,39241,808,45502,396,160
6Jul 28, 2024 17:24113,05471,105,60939,839,0001,991,0002,289,664
7Jul 28, 2024 17:24113,08667,610,39740,846,000996,0002,523,136
8Jul 28, 2024 17:24113,324108,486,74441,929,87702,269,184
9Jul 28, 2024 17:24113,42764,467,50639,970,0001,998,0002,289,664
10Jul 28, 2024 17:24113,53568,304,57440,008,0002,000,0002,289,664
11Jul 28, 2024 17:24113,54364,562,48540,011,0002,000,0002,531,328
12Jul 28, 2024 17:24115,967123,264,13642,907,94802,277,376