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 17, 2026 03:25M-RochatM-RochatScore: 18,709Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 03:2718,212609,738,331597,713,0003,286,0002,113,536
2May 17, 2026 03:2718,230611,076,371598,347,0003,244,0002,113,536
3May 17, 2026 03:2718,403618,495,236604,310,0003,012,0002,113,536
4May 17, 2026 03:2718,662626,481,618612,519,0003,354,0002,113,536
5May 17, 2026 03:2718,709626,268,014614,207,0003,198,0002,113,536
6May 17, 2026 03:2719,015639,538,670624,511,0003,009,0002,113,536
7May 17, 2026 03:2719,645657,055,573645,282,0003,009,0002,113,536
8May 17, 2026 03:2719,852665,023,617652,118,0003,010,0002,113,536
9May 17, 2026 03:2719,993670,383,714656,767,0003,011,0002,113,536