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 9, 2026 07:22Karthik ReddyKarthik ReddyScore: 53,810Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 07:2453,7186,029,082,25419,876,000020,480
2Oct 9, 2026 07:2453,7246,029,897,21319,878,000020,480
3Oct 9, 2026 07:2453,7326,029,061,06919,881,000020,480
4Oct 9, 2026 07:2453,7676,029,168,97919,894,000020,480
5Oct 9, 2026 07:2453,8106,029,105,99719,910,000020,480
6Oct 9, 2026 07:2453,8216,029,259,35519,914,000020,480
7Oct 9, 2026 07:2453,8456,029,188,51619,923,000020,480
8Oct 9, 2026 07:2453,8866,029,182,95419,938,000020,480
9Oct 9, 2026 07:2453,9546,029,039,39719,963,000020,480