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 listJan 9, 2026 20:39Pavel SkripkinPavel SkripkinScore: 87,834Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 20:3986,5402,882,519,2872,846,818,0008,996,0002,281,472
2Jan 9, 2026 20:3987,8342,925,219,9652,888,522,0009,994,0002,371,584
3Jan 9, 2026 20:3992,8303,092,566,0753,053,392,0009,994,0002,281,472