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 listApr 26, 2026 18:09TudyMTudyMScore: 21,607Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 18:1021,106633,202,3711,576,182,00094,950,0002,457,600
2Apr 26, 2026 18:1021,312639,383,3271,576,573,000106,903,0002,613,248
3Apr 26, 2026 18:1021,503645,115,2721,599,558,000101,908,0002,670,592
4Apr 26, 2026 18:1021,517645,523,2721,598,338,000101,894,0002,777,088
5Apr 26, 2026 18:1021,607648,219,2661,618,824,00095,930,0002,551,808
6Apr 26, 2026 18:1021,824654,724,4811,620,706,000103,981,0002,433,024
7Apr 26, 2026 18:1022,380671,405,0431,677,338,000100,840,0002,772,992
8Apr 26, 2026 18:1022,391671,739,6261,675,522,000105,780,0002,555,904
9Apr 26, 2026 18:1022,400672,012,7301,674,966,000102,752,0002,629,632