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 04:52M-RochatM-RochatScore: 21,719Success
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 04:5321,495721,416,073704,353,0005,012,0002,113,536
2May 17, 2026 04:5321,512720,358,845704,910,0005,014,0002,113,536
3May 17, 2026 04:5321,565723,533,949706,640,0005,018,0002,113,536
4May 17, 2026 04:5321,611723,384,720708,138,0005,051,0002,113,536
5May 17, 2026 04:5321,719728,344,921711,671,0005,066,0002,113,536
6May 17, 2026 04:5321,725727,701,454711,892,0005,043,0002,113,536
7May 17, 2026 04:5321,784729,905,242713,805,0005,072,0002,113,536
8May 17, 2026 04:5322,287745,320,699730,455,0005,044,0002,113,536
9May 17, 2026 04:5322,520752,961,709738,129,0005,053,0002,113,536