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 21:30IlyaIlyaScore: 21,668,951Success
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 21:3221,595,7438,000,370,1637,837,672,000152,753,0002,113,536
2Jul 8, 2026 21:3221,610,6518,006,279,2617,846,395,000149,546,0002,113,536
3Jul 8, 2026 21:3221,652,8898,021,885,1157,860,149,000151,420,0002,113,536
4Jul 8, 2026 21:3221,654,3088,022,435,4877,865,066,000147,028,0002,113,536
5Jul 8, 2026 21:3221,668,9518,028,662,6817,868,834,000148,678,0002,113,536
6Jul 8, 2026 21:3221,714,2568,044,275,5097,882,012,000152,263,0002,113,536
7Jul 8, 2026 21:3221,748,0058,056,723,4307,895,814,000150,948,0002,113,536
8Jul 8, 2026 21:3221,759,3838,061,379,3927,900,555,000150,417,0002,113,536
9Jul 8, 2026 21:3221,846,4918,093,168,8447,932,912,000150,290,0002,113,536