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 15, 2025 17:46Valentin KofmanValentin KofmanScore: 71,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2025 17:4670,66551,654,91225,141,0001,005,0002,281,472
2Jul 15, 2025 17:4670,83847,938,99524,194,0002,016,0002,387,968
3Jul 15, 2025 17:4671,22247,065,60524,325,0002,027,0002,281,472
4Jul 15, 2025 17:4671,31157,123,91124,356,0002,029,0002,277,376
5Jul 15, 2025 17:4671,62247,486,90426,500,00002,281,472
6Jul 15, 2025 17:4671,62252,817,92426,500,00002,269,184
7Jul 15, 2025 17:4671,80052,646,28025,545,0001,021,0002,281,472
8Jul 15, 2025 17:4671,87359,557,78525,571,0001,022,0002,281,472
9Jul 15, 2025 17:4672,13255,831,35325,663,0001,026,0002,371,584