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 listJul 7, 2026 12:54IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 12:54030,754,53820,033,0001,122,0002,113,536expected "429496496627 ", got "429496481313 "
2Jul 7, 2026 12:54030,810,34820,072,0001,116,0002,113,536expected "429496473931 ", got "429496465891 "
3Jul 7, 2026 12:54030,586,89019,890,0001,115,0002,113,536expected "429496506776 ", got "429496487186 "