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 listSep 25, 2025 14:38Wookyung JeongWookyung JeongScore: 235,119Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2025 14:38234,3737,766,820,9287,543,439,000190,859,0002,326,528
2Sep 25, 2025 14:38235,1197,791,719,4277,551,058,000207,863,0002,445,312
3Sep 25, 2025 14:38236,3807,830,894,7457,592,657,000207,881,0002,318,336