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 2, 2026 20:46zielajzielajScore: 3,347Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 20:473,186127,660,464103,121,0002,002,0002,404,352
2Jan 2, 2026 20:473,240135,649,080103,922,0002,997,0002,494,464
3Jan 2, 2026 20:473,318134,789,554108,499,0001,004,0002,416,640
4Jan 2, 2026 20:463,347136,503,781108,443,0002,008,0002,420,736
5Jan 2, 2026 20:463,468137,967,869113,428,0001,003,0002,269,184
6Jan 2, 2026 20:463,501139,928,519115,535,00002,412,544