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 24, 2026 07:12Victor MerckléVictor MerckléScore: 4,876Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 07:134,851167,987,111123,247,00036,856,0002,113,536
2Jun 24, 2026 07:134,860168,084,260123,662,00036,723,0002,113,536
3Jun 24, 2026 07:134,869168,847,811123,766,00036,914,0002,113,536
4Jun 24, 2026 07:134,871168,320,042123,033,00037,737,0002,113,536
5Jun 24, 2026 07:134,876169,055,326123,357,00037,572,0002,113,536
6Jun 24, 2026 07:134,878168,970,043123,341,00037,637,0002,113,536
7Jun 24, 2026 07:134,884169,287,854124,316,00036,861,0002,113,536
8Jun 24, 2026 07:134,892169,323,646123,867,00037,590,0002,113,536
9Jun 24, 2026 07:134,912169,764,269124,437,00037,683,0002,113,536