Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 listAug 18, 2026 04:25Josu San MartinJosu San MartinScore: 4,626Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 04:274,588137,669,983195,156,0003,096,0002,146,304
2Aug 18, 2026 04:274,592137,782,476195,108,0003,031,0002,146,304
3Aug 18, 2026 04:274,615138,473,175195,405,0003,092,0002,146,304
4Aug 18, 2026 04:274,618138,567,019196,146,0003,039,0002,146,304
5Aug 18, 2026 04:274,626138,806,348196,511,0004,024,0002,146,304
6Aug 18, 2026 04:274,633139,016,809195,656,0004,141,0002,146,304
7Aug 18, 2026 04:274,636139,107,356193,634,0004,116,0002,134,016
8Aug 18, 2026 04:274,639139,182,637195,546,0004,143,0002,146,304
9Aug 18, 2026 04:274,702141,063,496198,917,0003,088,0002,125,824