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 listApr 18, 2025 19:48KeefeKeefeScore: 76,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 19:4875,89547,703,80427,079,0001,002,0002,400,256
2Apr 18, 2025 19:4875,97851,482,81827,108,0001,004,0002,273,280
3Apr 18, 2025 19:4876,04956,749,68726,129,0002,009,0002,273,280
4Apr 18, 2025 19:4876,10555,225,63227,154,0001,005,0002,273,280
5Apr 18, 2025 19:4876,16854,007,19827,176,0001,006,0002,400,256
6Apr 18, 2025 19:4876,27053,879,50226,205,0002,015,0002,273,280
7Apr 18, 2025 19:4876,31450,623,67726,220,0002,016,0002,404,352
8Apr 18, 2025 19:4876,31451,695,73126,220,0002,016,0002,273,280
9Apr 18, 2025 19:4876,53853,715,06426,297,0002,022,0002,510,848