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 listDec 2, 2024 21:49mebowlermebowlerScore: 2,255,119Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 2, 2024 21:491,539,176598,312,566400,645,000168,850,0002,482,176
2Dec 2, 2024 21:492,255,119863,456,388660,521,000173,873,0002,441,216
3Dec 2, 2024 21:492,306,516876,903,780668,539,000184,872,0002,494,464