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 listJan 28, 2025 09:20mebowlermebowlerScore: 275,824Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2025 09:20275,124127,315,47760,878,00040,918,0002,420,736
2Jan 28, 2025 09:20275,824127,492,75861,033,00041,022,0002,330,624
3Jan 28, 2025 09:20276,797126,141,16555,224,00047,191,0002,412,544