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 listOct 25, 2022 01:15Kenneth MaplesKenneth MaplesScore: 75,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2022 01:1574,42250,569,95925,497,0002,039,0002,498,560
2Oct 25, 2022 01:1574,49551,731,91426,543,0001,020,0002,277,376
3Oct 25, 2022 01:1574,51953,440,69026,551,0001,021,0002,502,656
4Oct 25, 2022 01:1574,68958,029,87925,588,0002,047,0002,330,624
5Oct 25, 2022 01:1574,83853,344,90226,665,0001,025,0002,490,368
6Oct 25, 2022 01:1574,92459,404,53025,669,0002,053,0002,277,376
7Oct 25, 2022 01:1575,23056,431,38924,853,0002,982,0002,277,376
8Oct 25, 2022 01:1575,27855,863,23426,859,000994,0002,277,376
9Oct 25, 2022 01:1575,28457,916,92824,871,0002,984,0002,498,560
10Oct 25, 2022 01:1579,021101,575,07129,237,84402,224,128
11Oct 25, 2022 01:1579,421101,236,49529,385,90502,220,032
12Oct 25, 2022 01:1579,67688,725,10729,480,30202,228,224