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 listJul 8, 2021 21:01Vitaliy F.Vitaliy F.Score: 2,219,952Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 21:011,545,319643,363,442571,768,02102,248,704
2Jul 8, 2021 21:012,219,952892,391,967821,382,21702,248,704
3Jul 8, 2021 21:012,707,6001,060,116,6691,001,811,94402,252,800