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 15:22Josu San MartinJosu San MartinScore: 25,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 02:1025,192861,986,091811,357,00019,984,0002,490,368
2Jan 2, 2026 15:2225,256864,323,135818,474,00014,990,0002,367,488
3Jan 3, 2026 02:1025,261857,472,126814,626,00018,991,0002,281,472
4Jan 2, 2026 15:2225,278862,929,595818,191,00015,984,0002,281,472
5Jan 2, 2026 15:2225,378861,725,618821,479,00015,989,0002,314,240
6Jan 3, 2026 02:1025,383866,597,899819,633,00017,991,0002,314,240