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 29, 2026 19:54Andrew TsibinAndrew TsibinScore: 79,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 19:5573,68938,901,70120,431,0006,834,0002,113,536
2Jul 29, 2026 19:5575,80838,221,07820,464,0007,585,0002,113,536
3Jul 29, 2026 19:5577,25938,624,36120,563,0008,023,00020,480
4Jul 29, 2026 19:5578,64539,072,73220,539,0008,560,00020,480
5Jul 29, 2026 19:5579,45439,507,48520,734,0008,664,0002,113,536
6Jul 29, 2026 19:5582,14541,842,52220,964,0009,430,00020,480
7Jul 29, 2026 19:5583,45140,880,56720,858,00010,019,0002,113,536
8Jul 29, 2026 19:5583,76741,004,72620,799,00010,195,0002,113,536
9Jul 29, 2026 19:5599,13747,393,20321,402,00015,279,0002,113,536