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:46anboto1anboto1Score: 22,204Success
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:4721,940733,297,570717,197,0006,847,0002,113,536
2Jun 7, 2026 17:4722,054737,428,638721,093,0006,698,0002,113,536
3Jun 7, 2026 17:4722,111739,055,407722,947,0006,737,0002,113,536
4Jun 7, 2026 17:4722,168740,935,936724,703,0006,859,0002,113,536
5Jun 7, 2026 17:4722,204742,053,107725,961,0006,788,0002,113,536
6Jun 7, 2026 17:4722,309746,006,749729,528,0006,688,0002,113,536
7Jun 7, 2026 17:4723,156773,548,981757,097,0007,078,0002,113,536
8Jun 7, 2026 17:4723,389781,116,574764,943,0006,919,0002,113,536
9Jun 7, 2026 17:4724,279820,207,227794,361,0006,860,0002,113,536