Unique strings Sergey Svistunov

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listOct 9, 2026 19:07highload-churnerhighload-churnerScore: 11,314Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 19:0810,534360,268,931299,399,00048,244,00020,480
2Oct 9, 2026 19:0810,643362,135,936302,845,00048,393,00020,480
3Oct 9, 2026 19:0810,858369,242,975310,406,00047,931,00020,480
4Oct 9, 2026 19:0811,291383,058,070322,291,00050,319,00020,480
5Oct 9, 2026 19:0811,314383,805,896322,995,00050,392,00020,480
6Oct 9, 2026 19:0811,325384,168,484323,518,00050,208,00020,480
7Oct 9, 2026 19:0811,346384,941,533324,910,00049,519,00020,480
8Oct 9, 2026 19:0811,354385,083,037324,368,00050,322,00020,480
9Oct 9, 2026 19:0811,448388,376,533328,198,00049,609,00020,480