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 20:46Drew GarciaDrew GarciaScore: 76,738Success
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 20:4676,25452,883,43727,207,0001,007,0002,281,472
2Apr 18, 2025 20:4676,35150,934,03725,224,0003,026,0002,289,664
3Apr 18, 2025 20:4676,37352,545,74726,240,0002,018,0002,277,376
4Apr 18, 2025 20:4676,65950,608,15926,338,0002,026,0002,281,472
5Apr 18, 2025 20:4676,73851,316,78826,365,0002,028,0002,281,472
6Apr 18, 2025 20:4676,74153,572,79326,366,0002,028,0002,281,472
7Apr 18, 2025 20:4676,88954,243,96825,401,0003,048,0002,277,376
8Apr 18, 2025 20:4677,45759,949,94227,636,0001,023,0002,281,472
9Apr 18, 2025 20:4679,66552,264,51726,427,0003,049,0002,273,280