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 24, 2024 17:29AnSaAnSaScore: 73,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2024 17:2973,12249,170,55726,053,0001,002,0002,277,376
2Jul 24, 2024 17:2973,26548,549,73324,096,0003,012,0002,523,136
3Jul 24, 2024 17:2973,37348,820,56124,132,0003,016,0002,531,328
4Jul 24, 2024 17:2973,40549,793,73525,149,0002,011,0002,269,184
5Jul 24, 2024 17:2973,41453,525,67025,151,0002,012,0002,277,376
6Jul 24, 2024 17:2973,44949,409,28323,150,0004,026,0002,269,184
7Jul 24, 2024 17:2973,48953,913,94325,177,0002,014,0002,269,184
8Jul 24, 2024 17:2973,56549,818,43325,203,0002,016,0002,277,376
9Jul 24, 2024 17:2973,73553,394,01625,262,0002,020,0002,277,376
10Jul 24, 2024 17:2978,346113,321,93228,987,91802,273,280
11Jul 24, 2024 17:2978,53298,135,33529,056,79002,269,184
12Jul 24, 2024 17:2978,60799,396,79929,084,66202,265,088