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 8, 2026 10:32IlyaIlyaScore: 59,081Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 10:3458,84031,532,45120,664,0001,107,0002,113,536
2Jul 8, 2026 10:3458,91631,467,88620,679,0001,120,0002,113,536
3Jul 8, 2026 10:3458,97531,537,35820,658,0001,163,0002,113,536
4Jul 8, 2026 10:3459,03731,390,11520,663,0001,181,0002,113,536
5Jul 8, 2026 10:3459,08131,555,41420,744,0001,116,0002,113,536
6Jul 8, 2026 10:3459,11331,526,62220,735,0001,137,0002,113,536
7Jul 8, 2026 10:3459,16732,138,41020,683,0001,209,0002,113,536
8Jul 8, 2026 10:3459,28131,602,46120,902,0001,032,0002,113,536
9Jul 8, 2026 10:3459,51631,658,70120,995,0001,026,0002,113,536