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 listMar 26, 2026 11:32Dominique GarmierDominique GarmierScore: 34,575Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 11:3234,2071,156,765,3861,122,842,0005,993,0002,371,584
2Mar 26, 2026 11:3234,5751,178,180,7101,135,978,0004,995,0002,371,584
3Mar 26, 2026 11:3234,6221,181,104,5591,136,515,0005,997,0002,551,808