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:20AnSaAnSaScore: 77,022Success
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:2076,47057,444,12426,273,0002,021,0002,523,136
2Jan 29, 2024 15:2076,55950,292,24126,304,0002,023,0002,277,376
3Jan 29, 2024 15:2076,63557,124,11627,343,0001,012,0002,269,184
4Jan 29, 2024 15:2076,63854,345,15228,356,00002,273,280
5Jan 29, 2024 15:2076,72749,875,62724,334,0004,055,0002,277,376
6Jan 29, 2024 15:2076,75450,962,87127,385,0001,014,0002,281,472
7Jan 29, 2024 15:2077,02251,635,10226,463,0002,035,0002,277,376
8Jan 29, 2024 15:2077,13549,301,18028,540,00002,527,232
9Jan 29, 2024 15:2077,49558,696,95027,649,0001,024,0002,519,040
10Jan 29, 2024 15:2081,35996,240,73430,102,67802,269,184
11Jan 29, 2024 15:2081,371104,562,69630,107,27702,265,088
12Jan 29, 2024 15:2081,50698,396,60030,157,18902,179,072