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 13, 2026 22:31Adam FolwarcznyAdam FolwarcznyScore: 20,079Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 22:2719,930684,365,978639,715,00017,991,0002,318,336
2Jan 13, 2026 22:3119,980688,283,476642,348,00016,982,0002,322,432
3Jan 13, 2026 22:2720,054690,786,671643,796,00017,994,0002,334,720
4Jan 13, 2026 22:3120,079689,869,000644,627,00017,989,0002,514,944
5Jan 13, 2026 22:2720,132702,126,518646,386,00017,982,0002,514,944
6Jan 13, 2026 22:3120,316701,808,144649,434,00020,981,0002,514,944