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 15:16Andrew EpsteinAndrew EpsteinScore: 56,051Success
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 15:1955,89129,298,34820,680,000020,480
2Sep 20, 2026 15:1955,89429,266,78120,681,000020,480
3Sep 20, 2026 15:1955,91329,066,11320,688,000020,480
4Sep 20, 2026 15:1955,97029,294,34020,709,000020,480
5Sep 20, 2026 15:1956,05129,317,66120,739,000020,480
6Sep 20, 2026 15:1956,11629,334,71720,763,000020,480
7Sep 20, 2026 15:1956,16729,179,67720,782,000020,480
8Sep 20, 2026 15:1956,21029,384,32520,798,000020,480
9Sep 20, 2026 15:1956,21829,141,60420,801,000020,480