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 listApr 18, 2025 19:00emily graceemily graceScore: 72,927Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 19:0072,65753,990,56024,892,0001,991,0002,289,664
2Apr 18, 2025 19:0072,92754,867,35224,985,0001,998,0002,289,664
3Apr 18, 2025 19:0072,95751,338,54424,995,0001,999,0002,289,664