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 7, 2021 22:23Yuriy LyfenkoYuriy LyfenkoScore: 1,663,267Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2021 22:23214,868535,524,05779,501,147063,471,616
2Jul 7, 2021 22:23217,154492,449,04880,347,043058,748,928
3Jul 7, 2021 22:23218,885594,444,53180,987,316063,475,712
4Jul 7, 2021 22:231,663,267689,949,056615,408,72102,277,376
5Jul 7, 2021 22:234,519,9201,725,496,0741,672,370,26102,199,552
6Jul 7, 2021 22:2321,768,7358,185,511,4388,054,432,03102,224,128