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 08:12Karthik ReddyKarthik ReddyScore: 54,089Success
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 08:1853,5816,028,989,42319,825,000020,480
2Oct 9, 2026 08:1853,6946,029,095,38119,867,000020,480
3Oct 9, 2026 08:1853,7376,029,022,42119,883,000020,480
4Oct 9, 2026 08:1853,9216,037,817,26519,951,000020,480
5Oct 9, 2026 08:1854,0896,039,416,50620,013,000020,480
6Oct 9, 2026 08:1856,0436,038,027,89320,736,000020,480
7Oct 9, 2026 08:1856,1566,030,498,67820,778,000020,480
8Oct 9, 2026 08:1856,5216,038,978,34220,913,000020,480
9Oct 9, 2026 08:1856,6706,038,207,00420,968,000020,480