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 01:20Josu San MartinJosu San MartinScore: 18,490Success
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 01:2018,245547,352,3831,336,781,00081,986,0002,715,648
2Dec 25, 2025 01:2018,297548,916,1971,335,207,00088,947,0002,703,360
3Dec 25, 2025 01:2018,323549,704,1391,344,123,00073,951,0002,523,136
4Dec 25, 2025 01:2018,345550,349,6191,361,507,00069,923,0002,727,936
5Dec 25, 2025 01:2018,490554,685,8161,360,247,00072,906,0002,654,208
6Dec 25, 2025 01:2018,525555,762,4871,336,235,00085,886,0002,625,536
7Dec 25, 2025 01:2018,530555,908,0601,356,242,00075,901,0002,711,552
8Dec 25, 2025 01:2018,550556,510,1861,364,694,00071,983,0002,797,568
9Dec 25, 2025 01:2019,426582,789,3941,437,880,00075,782,0002,727,936