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 listMay 2, 2025 13:15KeefeKeefeScore: 70,524Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 2, 2025 13:1570,29253,021,36124,008,0002,000,0002,273,280
2May 2, 2025 13:1570,38651,246,22124,040,0002,003,0002,404,352
3May 2, 2025 13:1570,48448,366,84725,076,0001,003,0002,392,064
4May 2, 2025 13:1570,52453,902,91125,091,0001,003,0002,273,280
5May 2, 2025 13:1570,67053,946,78524,137,0002,011,0002,400,256
6May 2, 2025 13:1570,67650,929,80525,145,0001,005,0002,273,280