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 17:46IlyaIlyaScore: 59,227Success
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 17:4759,05931,476,04120,724,0001,128,0002,113,536
2Jul 8, 2026 17:4759,10031,529,23020,743,0001,124,0002,113,536
3Jul 8, 2026 17:4759,16231,584,53620,766,0001,124,0002,113,536
4Jul 8, 2026 17:4759,21331,601,27320,758,0001,151,0002,113,536
5Jul 8, 2026 17:4759,22731,570,87120,718,0001,196,0002,113,536
6Jul 8, 2026 17:4759,23231,905,17120,766,0001,150,0002,113,536
7Jul 8, 2026 17:4759,25931,571,15420,813,0001,113,0002,113,536
8Jul 8, 2026 17:4759,30031,572,26620,815,0001,126,0002,113,536
9Jul 8, 2026 17:4759,47831,996,89120,798,0001,209,0002,113,536