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 00:58olliecrowolliecrowScore: 13,136Success
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 00:5813,018450,434,658351,661,00077,925,0002,490,368
2Mar 22, 2026 01:0513,089460,124,660354,117,00077,806,0002,367,488
3Mar 22, 2026 01:0513,114455,432,897357,811,00074,960,0002,490,368
4Mar 22, 2026 00:5813,136453,459,938354,568,00078,904,0002,449,408
5Mar 22, 2026 01:0513,190460,411,380353,407,00081,862,0002,482,176
6Mar 22, 2026 00:5813,201459,351,978359,694,00075,935,0002,494,464