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 25, 2025 15:55Josu San MartinJosu San MartinScore: 65,165Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 25, 2025 15:5564,6291,938,864,3761,866,901,00044,973,0002,547,712
2Dec 25, 2025 05:0164,7321,941,953,3761,871,164,00040,981,0002,547,712
3Dec 25, 2025 05:0164,9601,948,806,1211,874,305,00046,982,0002,764,800
4Dec 25, 2025 15:5565,1651,954,956,5481,882,969,00042,976,0002,551,808
5Dec 25, 2025 15:5565,2081,956,241,7861,880,030,00044,976,0002,555,904
6Dec 25, 2025 05:0165,7361,972,092,3381,890,642,00048,964,0002,768,896