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 12, 2026 23:19Adam FolwarcznyAdam FolwarcznyScore: 21,737Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 23:1921,569735,375,652695,797,00015,995,0002,322,432
2Jan 12, 2026 23:1921,593744,814,094692,553,00020,015,0002,510,848
3Jan 12, 2026 23:1921,667740,767,091699,012,00016,000,0002,322,432
4Jan 12, 2026 23:1921,673745,483,306697,224,00017,980,0002,310,144
5Jan 12, 2026 23:1921,737748,568,901701,329,00015,984,0002,322,432
6Jan 12, 2026 23:1921,790748,623,174703,053,00016,001,0002,330,624
7Jan 12, 2026 23:1921,809743,936,972701,707,00017,992,0002,519,040
8Jan 12, 2026 23:1921,824752,342,138702,198,00017,979,0002,314,240
9Jan 12, 2026 23:1921,859746,086,252703,358,00017,983,0002,510,848