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 listAug 28, 2023 21:31Franek KortaFranek KortaScore: 64,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2023 21:3164,51648,506,89622,877,000994,0002,445,312
2Aug 28, 2023 21:3164,51948,857,35320,888,0002,984,0002,437,120
3Aug 28, 2023 21:3164,51950,882,51423,872,00002,445,312
4Aug 28, 2023 21:3164,63551,608,37322,919,000996,0002,441,216
5Aug 28, 2023 21:3164,81947,614,73922,984,000999,0002,441,216
6Aug 28, 2023 21:3164,84345,368,12121,993,0001,999,0002,531,328
7Aug 28, 2023 21:3164,89246,190,60923,010,0001,000,0002,441,216
8Aug 28, 2023 21:3164,90845,938,50822,015,0002,001,0002,531,328
9Aug 28, 2023 21:3164,95144,359,33023,031,0001,001,0002,437,120
10Aug 28, 2023 21:3169,82596,927,71325,835,10302,281,472
11Aug 28, 2023 21:3169,98282,111,23025,893,41002,289,664
12Aug 28, 2023 21:3170,57198,213,22926,111,25002,289,664