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 18:02Valentin KofmanValentin KofmanScore: 66,732Success
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 18:0266,12246,897,53423,446,0001,019,0002,387,968
2Jul 15, 2025 18:0266,73250,872,99623,663,0001,028,0002,392,064
3Jul 15, 2025 18:0267,18452,762,67723,864,000994,0002,269,184