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:51KeefeKeefeScore: 77,978Success
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:5177,59259,047,37127,684,0001,025,0002,273,280
2Apr 18, 2025 19:5277,95761,574,67526,855,0001,989,0002,273,280
3Apr 18, 2025 19:5277,97654,884,71026,862,0001,989,0002,392,064
4Apr 18, 2025 19:5177,97857,114,70126,863,0001,989,0002,392,064
5Apr 18, 2025 19:5278,00856,515,63827,868,000995,0002,273,280
6Apr 18, 2025 19:5178,23055,960,88426,949,0001,996,0002,510,848