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:39IlyaIlyaScore: 58,816Success
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:4158,44031,384,17320,521,0001,102,0002,113,536
2Jul 8, 2026 21:4158,57531,385,58020,481,0001,192,0002,113,536
3Jul 8, 2026 21:4158,59431,410,83320,549,0001,131,0002,113,536
4Jul 8, 2026 21:4158,71831,758,22920,513,0001,213,0002,113,536
5Jul 8, 2026 21:4158,81632,035,50220,510,0001,252,0002,113,536
6Jul 8, 2026 21:4158,96732,076,07720,578,0001,240,0002,113,536
7Jul 8, 2026 21:4121,552,8727,984,356,7457,824,750,000149,813,0002,113,536
8Jul 8, 2026 21:4121,573,5297,992,075,3877,832,147,000150,059,0002,113,536
9Jul 8, 2026 21:4121,623,0378,010,323,8087,852,036,000148,488,0002,113,536