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 listMar 22, 2026 07:40olliecrowolliecrowScore: 9,919Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 07:409,869347,221,257319,690,0005,994,0002,482,176
2Mar 22, 2026 07:409,889351,927,554324,342,0001,995,0002,473,984
3Mar 22, 2026 07:409,904355,732,737320,847,0005,997,0002,347,008
4Mar 22, 2026 07:409,912352,580,554322,110,0005,001,0002,473,984
5Mar 22, 2026 07:409,919352,579,160324,328,0002,993,0002,473,984
6Mar 22, 2026 07:409,927346,871,582321,589,0005,992,0002,531,328
7Mar 22, 2026 07:409,952353,111,177322,430,0005,989,0002,318,336
8Mar 22, 2026 07:409,956353,853,857322,570,0005,992,0002,289,664
9Mar 22, 2026 07:409,977348,833,496325,237,0004,002,0002,314,240