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 listOct 19, 2026 21:56e1011e1011Score: 21,224,181Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 21:5821,101,7787,819,212,7697,651,285,000156,373,0002,113,536
2Oct 19, 2026 21:5821,119,1917,825,559,9177,659,523,000154,578,0002,113,536
3Oct 19, 2026 21:5821,168,2677,843,353,9377,678,893,000153,366,0002,113,536
4Oct 19, 2026 21:5821,187,2757,850,991,7147,684,755,000154,537,0002,113,536
5Oct 19, 2026 21:5821,224,1817,864,441,5117,697,243,000155,704,0002,113,536
6Oct 19, 2026 21:5821,238,4297,870,285,3637,702,432,000155,787,0002,113,536
7Oct 19, 2026 21:5821,267,7867,880,172,9117,714,787,000154,294,0002,113,536
8Oct 19, 2026 21:5821,273,9947,882,531,0797,716,666,000154,712,0002,113,536
9Oct 19, 2026 21:5821,342,8817,908,004,7777,741,293,000155,573,0002,113,536