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 listJul 23, 2026 19:19boop34boop34Score: 10,598Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 19:2010,545357,727,593342,865,0005,144,0002,113,536
2Jul 23, 2026 19:2010,582359,043,476343,993,0005,242,0002,113,536
3Jul 23, 2026 19:2010,588359,142,684344,620,0004,787,0002,113,536
4Jul 23, 2026 19:2010,595359,402,621344,883,0004,782,0002,113,536
5Jul 23, 2026 19:2010,598359,525,316344,745,0005,006,0002,113,536
6Jul 23, 2026 19:2010,601359,721,798344,704,0005,137,0002,113,536
7Jul 23, 2026 19:2010,619360,852,668345,271,0005,186,0002,113,536
8Jul 23, 2026 19:2010,664361,715,616346,728,0005,192,0002,113,536
9Jul 23, 2026 19:2010,665361,750,766346,816,0005,154,0002,113,536