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 9, 2026 14:45Josu San MartinJosu San MartinScore: 6,795Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 14:456,716244,544,327217,648,0003,993,0002,371,584
2Jan 9, 2026 14:456,740246,878,473216,416,0006,011,0002,445,312
3Jan 9, 2026 14:456,746250,005,116215,623,0006,987,0002,347,008
4Jan 9, 2026 14:456,769249,908,598216,358,0007,011,0002,490,368
5Jan 9, 2026 14:456,795254,310,366219,238,0005,005,0002,363,392
6Jan 9, 2026 14:456,798254,881,241218,337,0006,009,0002,293,760
7Jan 9, 2026 14:457,058259,604,478227,918,0004,998,0002,347,008
8Jan 9, 2026 14:457,142266,088,196229,684,0005,991,0002,306,048
9Jan 9, 2026 14:457,143260,509,072232,722,0002,996,0002,326,528