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 2, 2022 08:28Robert BurkeRobert BurkeScore: 62,603Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 08:2862,25741,168,00622,034,0001,001,0002,424,832
2Aug 2, 2022 08:2862,39244,517,01522,082,0001,003,0002,273,280
3Aug 2, 2022 08:2862,41941,242,73822,091,0001,004,0002,273,280
4Aug 2, 2022 08:2862,47647,926,21922,111,0001,005,0002,535,424
5Aug 2, 2022 08:2862,48640,667,43922,115,0001,005,0002,433,024
6Aug 2, 2022 08:2862,48941,018,20922,116,0001,005,0002,424,832
7Aug 2, 2022 08:2862,60350,654,49221,149,0002,014,0002,420,736
8Aug 2, 2022 08:2862,71145,779,95821,186,0002,017,0002,424,832
9Aug 2, 2022 08:2862,71447,974,43921,187,0002,017,0002,433,024
10Aug 2, 2022 08:2865,58169,371,17024,264,93402,281,472
11Aug 2, 2022 08:2865,68093,333,46624,301,72102,269,184
12Aug 2, 2022 08:2865,91389,859,36524,387,87702,256,896