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 listJun 21, 2026 06:16Elijah KinElijah KinScore: 67,351Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 06:1767,05133,820,76823,710,0001,099,0002,113,536
2Jun 21, 2026 06:1767,13533,833,09423,718,0001,122,0002,113,536
3Jun 21, 2026 06:1767,15433,903,73923,736,0001,111,0002,113,536
4Jun 21, 2026 06:1767,32733,924,36323,800,0001,111,0002,113,536
5Jun 21, 2026 06:1767,35133,978,83623,805,0001,115,0002,113,536
6Jun 21, 2026 06:1767,47234,091,82223,925,0001,040,0002,113,536
7Jun 21, 2026 06:1767,78334,068,05623,965,0001,115,0002,113,536
8Jun 21, 2026 06:1767,78634,082,93223,938,0001,143,0002,113,536
9Jun 21, 2026 06:1767,78934,165,51023,957,0001,125,0002,113,536