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 20:02KeefeKeefeScore: 77,949Success
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 20:0277,29759,836,51127,579,0001,021,0002,273,280
2Apr 18, 2025 20:0277,94954,424,35527,847,000994,0002,519,040
3Apr 18, 2025 20:0279,70067,732,80928,473,0001,016,0002,273,280