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 listFeb 22, 2024 02:39Huy Duc LeHuy Duc LeScore: 92,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2024 02:3991,94156,222,12232,017,0002,001,0002,281,472
2Feb 22, 2024 02:3992,05156,455,23631,054,0003,005,0002,387,968
3Feb 22, 2024 02:3992,06855,265,41132,062,0002,003,0002,281,472
4Feb 22, 2024 02:3992,61460,609,59231,244,0003,023,0002,281,472
5Feb 22, 2024 02:3992,70858,072,04631,276,0003,026,0002,273,280
6Feb 22, 2024 02:3992,87663,351,31931,332,0003,032,0002,281,472
7Feb 22, 2024 02:3992,97357,501,34533,389,0001,011,0002,277,376
8Feb 22, 2024 02:3993,31165,299,24532,495,0002,030,0002,273,280
9Feb 22, 2024 02:3994,06261,939,30332,815,0001,988,0002,527,232
10Feb 22, 2024 02:3996,96498,906,50335,876,68102,269,184
11Feb 22, 2024 02:3997,33894,505,66536,015,11102,228,224
12Feb 22, 2024 02:3998,23498,966,09536,346,54602,273,280