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 08:50mebowlermebowlerScore: 291,354Success
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 08:50291,300134,029,21957,882,00049,899,0002,330,624
2Jan 28, 2025 08:50291,354139,633,63257,893,00049,908,0002,330,624
3Jan 28, 2025 08:50292,703131,205,88759,164,00049,136,0002,523,136