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 30, 2025 02:16KeefeKeefeScore: 126,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 30, 2025 02:16125,08173,158,95344,268,0002,012,0002,281,472
2Jan 30, 2025 02:16125,48469,584,58646,429,00002,269,184
3Jan 30, 2025 02:16125,55966,429,96545,448,0001,009,0002,523,136
4Jan 30, 2025 02:16125,90369,543,11445,572,0001,012,0002,281,472
5Jan 30, 2025 02:16126,10076,511,00045,643,0001,014,0002,281,472
6Jan 30, 2025 02:16126,29772,343,73444,699,0002,031,0002,273,280
7Jan 30, 2025 02:16126,50876,877,76842,825,0003,983,0002,269,184
8Jan 30, 2025 02:16126,59773,293,60345,845,000996,0002,281,472
9Jan 30, 2025 02:16127,14977,228,65345,044,0002,001,0002,281,472