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:23olliecrowolliecrowScore: 19,323Success
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:2319,191665,615,036607,334,00025,971,0002,506,752
2Jan 31, 2026 17:2319,203659,605,813610,707,00022,988,0002,490,368
3Jan 31, 2026 17:2319,221659,532,869609,288,00025,011,0002,347,008
4Jan 31, 2026 17:2319,249665,458,222612,203,00023,007,0002,433,024
5Jan 31, 2026 17:2319,323663,234,700614,673,00022,987,0002,502,656
6Jan 31, 2026 17:2319,454667,489,498618,024,00023,962,0002,469,888
7Jan 31, 2026 17:2319,572678,797,161621,912,00023,958,0002,502,656
8Jan 31, 2026 17:2319,589670,959,658626,457,00019,982,0002,383,872
9Jan 31, 2026 17:2319,842680,183,185631,818,00022,957,0002,486,272