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 listDec 6, 2025 18:00Rajarshi BasuRajarshi BasuScore: 543,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 18:00536,73016,101,909,50715,963,084,000105,934,0002,666,496
2Dec 6, 2025 18:00540,50416,215,114,72916,092,270,00084,953,0002,719,744
3Dec 6, 2025 18:00542,41216,272,352,09316,133,824,00097,944,0002,613,248
4Dec 6, 2025 18:00543,56416,306,914,36116,160,416,000106,929,0002,625,536
5Dec 6, 2025 18:00543,72216,311,666,07116,171,902,00099,931,0002,744,320
6Dec 6, 2025 18:00546,15216,384,547,36116,229,082,000121,925,0002,748,416
7Dec 6, 2025 18:00547,11016,413,287,77916,276,864,000100,943,0002,625,536
8Dec 6, 2025 18:00547,46816,424,047,22116,293,934,00094,935,0002,666,496
9Dec 6, 2025 18:00559,52616,785,793,72616,651,148,00095,943,0002,768,896