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 14, 2026 11:35Adam FolwarcznyAdam FolwarcznyScore: 19,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 14, 2026 11:3718,862647,096,229616,440,0005,994,0002,420,736
2Jan 14, 2026 11:3718,986651,060,442615,535,00010,991,0002,416,640
3Jan 14, 2026 11:3519,102656,746,950621,385,0008,991,0002,461,696
4Jan 14, 2026 11:3519,105652,578,530621,482,0008,992,0002,318,336
5Jan 14, 2026 11:3719,164658,853,087622,424,0009,990,0002,408,448
6Jan 14, 2026 11:3519,671676,465,044638,150,00010,985,0002,400,256