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 29, 2024 15:07AnSaAnSaScore: 95,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2024 15:0794,27361,469,37332,888,0001,993,0002,523,136
2Jan 29, 2024 15:0794,64160,593,42334,017,0001,000,0002,281,472
3Jan 29, 2024 15:0794,64661,757,40633,018,0002,001,0002,277,376
4Jan 29, 2024 15:0794,73262,458,98034,050,0001,001,0002,269,184
5Jan 29, 2024 15:0794,81657,639,08932,075,0003,007,0002,359,296
6Jan 29, 2024 15:0794,91659,205,04131,106,0004,013,0002,277,376
7Jan 29, 2024 15:0795,13562,464,00033,189,0002,011,0002,277,376
8Jan 29, 2024 15:0795,14660,058,89433,193,0002,011,0002,527,232
9Jan 29, 2024 15:0795,34657,509,62031,247,0004,031,0002,277,376
10Jan 29, 2024 15:0798,111103,487,69536,301,15902,265,088
11Jan 29, 2024 15:0798,375111,439,12836,398,83102,277,376
12Jan 29, 2024 15:0799,010107,255,25736,633,66402,224,128