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 12, 2026 19:13IlyaIlyaScore: 58,832Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 19:1558,44531,192,84620,513,0001,112,0002,113,536
2Jul 12, 2026 19:1558,53731,407,61220,512,0001,147,0002,113,536
3Jul 12, 2026 19:1558,57031,411,95020,469,0001,202,0002,113,536
4Jul 12, 2026 19:1558,58631,303,41920,472,0001,205,0002,113,536
5Jul 12, 2026 19:1558,83232,034,17320,539,0001,229,0002,113,536
6Jul 12, 2026 19:1558,92131,501,61520,771,0001,030,0002,113,536
7Jul 12, 2026 19:1521,553,3057,984,619,1187,826,580,000148,143,0002,113,536
8Jul 12, 2026 19:1521,639,5918,016,886,1737,856,457,000150,192,0002,113,536
9Jul 12, 2026 19:1521,812,2728,081,290,4337,919,674,000150,867,0002,113,536