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 listJan 10, 2026 02:00Josu San MartinJosu San MartinScore: 5,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 02:005,584215,341,304180,274,0004,006,0002,379,776
2Jan 10, 2026 02:005,597209,422,878180,701,0003,993,0002,277,376
3Jan 10, 2026 02:005,601210,067,611181,836,0002,997,0002,375,680
4Jan 10, 2026 02:005,615210,878,969182,299,0003,004,0002,469,888
5Jan 10, 2026 02:005,622211,914,921180,526,0004,986,0002,457,600
6Jan 10, 2026 02:005,626213,483,716180,672,0004,990,0002,416,640
7Jan 10, 2026 02:005,655213,366,138181,623,0004,989,0002,379,776
8Jan 10, 2026 02:005,695214,364,713183,921,0003,998,0002,424,832
9Jan 10, 2026 02:005,707218,951,722184,310,0004,006,0002,326,528