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:13Karthik ReddyKarthik ReddyScore: 53,735Success
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:3253,6946,028,883,17719,867,000020,480
2Oct 9, 2026 08:3253,6946,028,747,78319,867,000020,480
3Oct 9, 2026 08:3253,6976,028,805,01719,868,000020,480
4Oct 9, 2026 08:3253,7136,028,864,88019,874,000020,480
5Oct 9, 2026 08:3253,7356,029,009,86619,882,000020,480
6Oct 9, 2026 08:3253,7406,028,877,20519,884,000020,480
7Oct 9, 2026 08:3253,9166,028,953,22219,949,000020,480
8Oct 9, 2026 08:3253,9216,029,032,05119,951,000020,480
9Oct 9, 2026 08:3254,0246,029,089,86819,989,000020,480