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 1, 2026 13:31IlyaIlyaScore: 21,651,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 13:3321,489,9457,961,553,5957,792,736,000158,544,0002,113,536
2Jul 1, 2026 13:3321,559,2107,986,583,9207,817,003,000159,905,0002,113,536
3Jul 1, 2026 13:3321,631,8948,013,884,8667,850,847,000152,954,0002,113,536
4Jul 1, 2026 13:3321,641,1458,017,004,1137,847,947,000159,277,0002,113,536
5Jul 1, 2026 13:3321,651,7218,021,356,6587,859,091,000152,046,0002,113,536
6Jul 1, 2026 13:3321,682,4328,032,511,1977,864,335,000158,165,0002,113,536
7Jul 1, 2026 13:3321,682,9008,032,740,1547,865,334,000157,339,0002,113,536
8Jul 1, 2026 13:3321,704,7028,040,729,7057,877,575,000153,165,0002,113,536
9Jul 1, 2026 13:3321,797,1518,074,828,3987,909,257,000155,689,0002,113,536