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 8, 2026 12:55anboto1anboto1Score: 8,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 12:568,676295,536,030272,948,00013,365,0002,117,632
2Jun 8, 2026 12:568,679295,758,530272,972,00013,466,0002,117,632
3Jun 8, 2026 12:568,693296,146,299273,462,00013,436,0002,117,632
4Jun 8, 2026 12:568,694296,191,289273,556,00013,370,0002,117,632
5Jun 8, 2026 12:568,710296,725,635273,952,00013,494,0002,117,632
6Jun 8, 2026 12:568,723297,570,245274,420,00013,465,0002,117,632
7Jun 8, 2026 12:568,739297,721,665274,835,00013,573,0002,117,632
8Jun 8, 2026 12:568,739297,677,668274,762,00013,650,0002,121,728
9Jun 8, 2026 12:568,763298,585,608275,624,00013,555,0002,117,632