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 22:47emily graceemily graceScore: 70,024Success
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 22:4769,83552,170,36823,852,0001,987,0002,392,064
2Apr 18, 2025 22:4769,88649,051,34725,858,00002,289,664
3Apr 18, 2025 22:4769,95153,379,30124,847,0001,035,0002,269,184
4Apr 18, 2025 22:4770,00848,171,76223,911,0001,992,0002,273,280
5Apr 18, 2025 22:4770,02451,951,42723,916,0001,993,0002,289,664
6Apr 18, 2025 22:4770,09555,104,60023,940,0001,995,0002,527,232
7Apr 18, 2025 22:4770,37652,650,64024,036,0002,003,0002,289,664
8Apr 18, 2025 22:4770,53852,629,16325,096,0001,003,0002,289,664
9Apr 18, 2025 22:4770,70849,585,07024,150,0002,012,0002,363,392