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 listMay 22, 2024 20:04CemaCemaScore: 113,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2024 20:04112,11667,999,85741,483,00002,281,472
2May 22, 2024 20:04112,34969,271,24437,514,0004,055,0002,494,464
3May 22, 2024 20:04112,71668,754,90940,688,0001,017,0002,498,560
4May 22, 2024 20:04112,96567,272,20639,807,0001,990,0002,281,472
5May 22, 2024 20:04113,10576,655,28640,853,000996,0002,510,848
6May 22, 2024 20:04113,13569,411,50438,870,0002,990,0002,502,656
7May 22, 2024 20:04113,13865,992,16239,868,0001,993,0002,510,848
8May 22, 2024 20:04113,15770,929,26340,872,000996,0002,281,472
9May 22, 2024 20:04114,20364,760,58240,243,0002,012,0002,490,368
10May 22, 2024 20:04118,565106,308,02943,868,93502,232,320
11May 22, 2024 20:04118,661115,345,03543,904,64802,240,512
12May 22, 2024 20:04119,874111,819,72444,353,50302,215,936