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 27, 2026 18:47Victor MerckléVictor MerckléScore: 3,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 18:473,429122,825,800111,984,0001,175,0002,113,536
2Jun 27, 2026 18:473,435121,617,127112,195,0001,173,0002,113,536
3Jun 27, 2026 18:473,435121,833,853112,191,0001,173,0002,113,536
4Jun 27, 2026 18:473,437121,623,096112,255,0001,176,0002,113,536
5Jun 27, 2026 18:473,438121,800,947112,308,0001,171,0002,113,536
6Jun 27, 2026 18:473,441121,449,355112,407,0001,149,0002,113,536
7Jun 27, 2026 18:473,443121,880,269112,454,0001,175,0002,113,536
8Jun 27, 2026 18:473,444121,491,755112,498,0001,186,0002,113,536
9Jun 27, 2026 18:473,446121,657,336112,564,0001,182,0002,113,536