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 21:46Victor MerckléVictor MerckléScore: 5,754Success
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 21:475,744197,513,449188,469,0001,086,0002,113,536
2Jun 27, 2026 21:475,747197,344,468188,550,0001,111,0002,113,536
3Jun 27, 2026 21:475,752197,582,730188,727,0001,117,0002,113,536
4Jun 27, 2026 21:475,754197,713,156188,720,0001,171,0002,113,536
5Jun 27, 2026 21:475,754197,872,646188,827,0001,080,0002,113,536
6Jun 27, 2026 21:475,755197,683,728188,826,0001,118,0002,113,536
7Jun 27, 2026 21:475,755197,695,347188,802,0001,114,0002,113,536
8Jun 27, 2026 21:475,756197,650,517188,862,0001,114,0002,113,536
9Jun 27, 2026 21:475,758198,036,704188,845,0001,175,0002,113,536