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 listNov 21, 2023 12:21AdrKAdrKScore: 1,961,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2023 12:201,193,064515,130,871441,433,51602,289,664
2Nov 21, 2023 12:201,516,917624,640,733561,259,37402,297,856
3Nov 21, 2023 12:211,944,935784,031,017719,626,10802,297,856
4Nov 21, 2023 12:211,961,811793,859,039725,869,93802,297,856
5Nov 21, 2023 12:211,995,657791,237,855738,392,95502,174,976
6Nov 21, 2023 12:202,045,552824,456,886756,854,10102,289,664