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:58IlyaIlyaScore: 21,425,645Success
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 22:0058,32931,376,87520,485,0001,097,0002,113,536
2Jul 8, 2026 22:0058,43231,303,22320,498,0001,122,0002,113,536
3Jul 8, 2026 22:0058,86431,478,08520,557,0001,223,0002,113,536
4Jul 8, 2026 22:0021,420,4247,935,926,9407,776,939,000148,618,0002,113,536
5Jul 8, 2026 22:0021,425,6457,937,793,8527,772,840,000154,649,0002,113,536
6Jul 8, 2026 22:0021,428,4457,938,892,5837,781,616,000146,909,0002,113,536
7Jul 8, 2026 22:0021,484,0167,958,897,7567,796,424,000152,662,0002,113,536
8Jul 8, 2026 22:0021,553,9597,985,311,3317,824,116,000150,849,0002,113,536
9Jul 8, 2026 22:0021,617,1248,008,220,0047,845,732,000152,604,0002,113,536