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 listJan 17, 2025 06:24Ian MckibbenIan MckibbenScore: 81,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2025 06:2480,81952,015,34028,872,0001,031,0002,371,584
2Jan 17, 2025 06:2480,82457,193,66928,909,000996,0002,281,472
3Jan 17, 2025 06:2480,90055,575,57927,938,0001,995,0002,289,664
4Jan 17, 2025 06:2481,07053,791,23027,997,0001,999,0002,269,184
5Jan 17, 2025 06:2481,10057,571,32728,007,0002,000,0002,281,472
6Jan 17, 2025 06:2481,29755,524,68629,078,0001,002,0002,269,184
7Jan 17, 2025 06:2481,34656,277,60528,092,0002,006,0002,289,664
8Jan 17, 2025 06:2481,73053,075,76828,224,0002,016,0002,289,664
9Jan 17, 2025 06:2481,74657,317,04728,230,0002,016,0002,289,664