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 listJun 7, 2026 17:03anboto1anboto1Score: 26,103Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 17:0425,823861,570,273845,488,0006,671,0002,113,536
2Jun 7, 2026 17:0425,983866,912,414850,759,0006,686,0002,113,536
3Jun 7, 2026 17:0426,023868,592,487852,120,0006,639,0002,113,536
4Jun 7, 2026 17:0426,097871,000,211854,422,0006,794,0002,113,536
5Jun 7, 2026 17:0426,103871,195,046854,680,0006,738,0002,113,536
6Jun 7, 2026 17:0426,104871,197,806854,838,0006,616,0002,113,536
7Jun 7, 2026 17:0426,172873,476,236857,047,0006,648,0002,113,536
8Jun 7, 2026 17:0426,175873,208,034857,116,0006,661,0002,113,536
9Jun 7, 2026 17:0427,720924,112,768907,887,0006,881,0002,113,536