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 17, 2024 20:39IhebIhebScore: 18,809,773Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2024 20:3918,807,9067,026,823,7706,958,925,14102,277,376
2Aug 17, 2024 20:3918,809,7737,026,880,4266,959,615,84202,281,472
3Aug 17, 2024 20:3918,811,0407,025,253,0446,960,084,63602,277,376