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:26emily graceemily graceScore: 72,657Success
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:2672,55754,245,49524,858,0001,988,0002,527,232
2Apr 18, 2025 19:2672,58454,746,08624,867,0001,989,0002,527,232
3Apr 18, 2025 19:2672,63052,718,74224,883,0001,990,0002,289,664
4Apr 18, 2025 19:2672,65755,286,07724,892,0001,991,0002,527,232
5Apr 18, 2025 19:2672,72454,537,61924,915,0001,993,0002,277,376
6Apr 18, 2025 19:2673,31159,534,45725,116,0002,009,0002,289,664