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 listNov 8, 2024 18:46spacecat8086spacecat8086Score: 21,614,765Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2024 18:4621,462,7767,980,730,3207,732,379,000208,848,0002,281,472
2Nov 8, 2024 18:4621,529,7657,999,830,0517,768,162,000197,851,0002,281,472
3Nov 8, 2024 18:4621,541,6518,000,874,2867,767,554,000202,857,0002,281,472
4Nov 8, 2024 18:4621,550,0228,005,074,9447,758,683,000214,825,0002,281,472
5Nov 8, 2024 18:4621,614,7658,037,336,1417,793,630,000203,833,0002,281,472
6Nov 8, 2024 18:4621,649,7498,044,896,4117,803,552,000206,855,0002,281,472
7Nov 8, 2024 18:4621,680,7658,053,493,2657,809,046,000212,837,0002,293,760
8Nov 8, 2024 18:4621,702,5198,067,076,2277,837,078,000192,854,0002,469,888
9Nov 8, 2024 18:4621,711,3058,064,000,3047,820,338,000212,845,0002,281,472