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 16, 2025 00:07emily graceemily graceScore: 21,987,400Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2025 00:074,486,9321,688,942,6541,595,198,00064,967,0002,416,640
2Apr 16, 2025 00:0721,987,4008,168,223,1227,906,526,000228,812,0002,293,760
3Apr 16, 2025 00:0722,064,5868,196,045,0837,925,076,000238,821,0002,355,200