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 3, 2026 07:17Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 17:08Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 17:08015,036,4941,185,0002,497,0002,125,824expected "16384 ", got "445 "stderr
2Jul 4, 2026 17:08015,669,1771,450,0002,768,0002,125,824expected "16384 ", got "445 "stderr
3Jul 4, 2026 17:08014,282,6481,427,0002,921,0002,125,824expected "16384 ", got "445 "stderr
4Jan 3, 2026 07:173,227131,934,942102,482,0004,018,0002,297,856
5Jan 3, 2026 07:173,334135,779,056106,027,0004,001,0002,510,848
6Jan 3, 2026 07:173,357132,536,060107,793,0002,994,0002,347,008