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 listMar 15, 2025 10:41Aniruddha DebAniruddha DebScore: 72,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2025 10:4171,29551,683,41225,365,0001,014,0002,420,736
2Mar 15, 2025 10:4171,49548,222,29726,453,00002,424,832
3Mar 15, 2025 10:4171,55448,793,21126,475,00002,424,832
4Mar 15, 2025 10:4171,77645,346,42125,536,0001,021,0002,424,832
5Mar 15, 2025 10:4172,03056,708,16325,626,0001,025,0002,420,736
6Mar 15, 2025 10:4172,18154,951,25725,680,0001,027,0002,506,752
7Mar 15, 2025 10:4172,53551,144,31326,838,00002,531,328
8Mar 15, 2025 10:4172,56256,100,96525,854,000994,0002,428,928
9Mar 15, 2025 10:4172,60849,145,32625,870,000995,0002,424,832