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 26, 2026 06:27IlyaIlyaScore: 65,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 06:2864,96733,277,05422,919,0001,119,0002,113,536
2Jun 26, 2026 06:2865,22733,927,78222,913,0001,221,0002,113,536
3Jun 26, 2026 06:2865,31833,451,42723,031,0001,137,0002,113,536
4Jun 26, 2026 06:2865,39133,923,42922,969,0001,226,0002,113,536
5Jun 26, 2026 06:2865,62433,831,57023,056,0001,225,0002,113,536
6Jun 26, 2026 06:2865,70233,490,00623,155,0001,155,0002,113,536
7Jun 26, 2026 06:2865,71033,704,87523,156,0001,157,0002,113,536
8Jun 26, 2026 06:2865,71635,810,99123,076,0001,239,0002,113,536
9Jun 26, 2026 06:2865,75933,657,93923,309,0001,022,0002,113,536