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 listMay 21, 2026 18:05M-RochatM-RochatScore: 18,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 18:0618,226610,932,251597,375,0004,102,0002,113,536
2May 21, 2026 18:0618,282613,524,684599,291,0004,022,0002,113,536
3May 21, 2026 18:0618,360615,490,905602,896,0003,012,0002,113,536
4May 21, 2026 18:0618,382618,744,604603,619,0003,006,0002,113,536
5May 21, 2026 18:0618,420618,225,617603,807,0004,071,0002,113,536
6May 21, 2026 18:0618,439617,976,709604,448,0004,040,0002,113,536
7May 21, 2026 18:0618,573622,447,597608,877,0004,041,0002,113,536
8May 21, 2026 18:0618,883634,619,403619,128,0004,022,0002,113,536
9May 21, 2026 18:0618,933637,311,482620,721,0004,072,0002,113,536