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 31, 2026 17:16olliecrowolliecrowScore: 21,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 17:1620,890719,844,537674,373,00014,986,0002,482,176
2Jan 31, 2026 17:1620,893717,832,879674,496,00014,988,0002,297,856
3Jan 31, 2026 17:1620,916722,401,245678,212,00012,003,0002,289,664
4Jan 31, 2026 17:1620,992716,684,293680,747,00011,995,0002,297,856
5Jan 31, 2026 17:1621,003718,645,913679,090,00014,001,0002,293,760
6Jan 31, 2026 17:1621,095723,933,977684,122,00012,002,0002,281,472
7Jan 31, 2026 17:1621,117724,705,301680,869,00015,996,0002,416,640
8Jan 31, 2026 17:1621,283731,472,850682,348,00019,980,0002,301,952
9Jan 31, 2026 17:1621,689745,279,451703,745,00011,978,0002,301,952