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 listAug 1, 2026 17:03CodeReclaimersCodeReclaimersScore: 5,628Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 17:045,591194,617,910180,247,0004,285,0002,113,536
2Aug 1, 2026 17:045,593195,429,227180,347,0004,224,0002,113,536
3Aug 1, 2026 17:045,601195,822,371180,548,0004,310,0002,113,536
4Aug 1, 2026 17:045,624196,363,588181,222,0004,378,0002,113,536
5Aug 1, 2026 17:045,628196,547,204181,438,0004,301,0002,113,536
6Aug 1, 2026 17:045,795201,504,112186,705,0004,543,0002,113,536
7Aug 1, 2026 17:045,797201,509,787186,798,0004,534,0002,113,536
8Aug 1, 2026 17:045,810203,317,162187,189,0004,562,0002,113,536
9Aug 1, 2026 17:045,844203,833,659188,340,0004,536,0002,113,536