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 20, 2026 17:54Victor MerckléVictor MerckléScore: 6,591Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 17:556,586225,368,923179,781,00037,559,0002,113,536
2Jun 20, 2026 17:556,587225,443,231179,890,00037,505,0002,113,536
3Jun 20, 2026 17:556,590225,011,854179,957,00037,545,0002,113,536
4Jun 20, 2026 17:556,590224,899,549179,975,00037,496,0002,113,536
5Jun 20, 2026 17:556,591225,015,497179,991,00037,538,0002,113,536
6Jun 20, 2026 17:556,617225,917,269180,901,00037,477,0002,113,536
7Jun 20, 2026 17:556,617226,255,806180,149,00038,214,0002,113,536
8Jun 20, 2026 17:556,624226,062,777181,084,00037,513,0002,113,536
9Jun 20, 2026 17:556,635226,505,644181,433,00037,539,0002,113,536