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 listJun 30, 2026 10:04IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 10:05032,013,93020,803,0001,167,00016,384No answer to stdout. Died or killed?
2Jun 30, 2026 10:0559,86731,612,52721,060,0001,091,0002,113,536
3Jun 30, 2026 10:0559,97231,696,45121,076,0001,114,0002,113,536
4Jun 30, 2026 10:0560,05431,697,01121,107,0001,113,0002,113,536
5Jun 30, 2026 10:0560,17531,775,30821,084,0001,181,0002,113,536
6Jun 30, 2026 10:0560,23231,805,74521,170,0001,116,0002,113,536
7Jun 30, 2026 10:0560,27232,175,62121,120,0001,181,0002,113,536