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:11IlyaIlyaScore: 21,525,713Success
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:1358,74031,469,43820,506,0001,228,0002,113,536
2Jul 12, 2026 19:1358,74831,422,31920,551,0001,186,0002,113,536
3Jul 12, 2026 19:1358,82731,515,98420,691,0001,075,0002,113,536
4Jul 12, 2026 19:1321,462,0187,951,913,4347,791,654,000149,293,0002,113,536
5Jul 12, 2026 19:1321,525,7137,975,116,4087,817,066,000147,448,0002,113,536
6Jul 12, 2026 19:1321,546,0087,981,985,5947,818,136,000153,887,0002,113,536
7Jul 12, 2026 19:1321,585,1377,996,520,4797,837,444,000149,057,0002,113,536
8Jul 12, 2026 19:1321,620,0598,009,278,4377,851,422,000148,000,0002,113,536
9Jul 12, 2026 19:1321,757,6138,062,599,9997,895,001,000155,316,0002,113,536