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 19, 2025 00:09emily graceemily graceScore: 69,873Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2025 00:0969,81452,082,26624,838,000993,0002,269,184
2Apr 19, 2025 00:1069,81954,708,06623,846,0001,987,0002,273,280
3Apr 19, 2025 00:1069,85157,069,91523,857,0001,988,0002,289,664
4Apr 19, 2025 00:1069,87351,892,21724,859,000994,0002,527,232
5Apr 19, 2025 00:1069,87353,722,85223,865,0001,988,0002,289,664
6Apr 19, 2025 00:0970,02753,263,43524,914,000996,0002,289,664
7Apr 19, 2025 00:0970,17048,237,09223,966,0001,997,0002,285,568
8Apr 19, 2025 00:1070,27057,371,39424,000,0002,000,0002,375,680
9Apr 19, 2025 00:1070,33548,989,12924,023,0002,001,0002,289,664