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 11:37Oleg KovalovOleg KovalovScore: 550,897Success
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 11:37550,384231,634,212203,642,00002,330,624
2Jan 28, 2025 11:37550,897231,467,067202,833,000999,0002,330,624
3Jan 28, 2025 11:37551,422233,786,345202,026,0002,000,0002,330,624