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 listSep 20, 2026 16:35Andrew EpsteinAndrew EpsteinScore: 55,991Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2026 16:3655,90229,554,21120,684,000020,480
2Sep 20, 2026 16:3655,90829,526,25820,686,000020,480
3Sep 20, 2026 16:3655,97229,489,58620,710,000020,480
4Sep 20, 2026 16:3655,97230,828,86120,710,000020,480
5Sep 20, 2026 16:3655,99129,454,44720,717,000020,480
6Sep 20, 2026 16:3655,99730,772,54120,719,000020,480
7Sep 20, 2026 16:3656,10529,577,33620,759,000020,480
8Sep 20, 2026 16:3656,11829,592,09320,764,000020,480
9Sep 20, 2026 16:3656,17229,631,39920,784,000020,480