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:23Josu San MartinJosu San MartinScore: 4,661Success
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:244,651139,555,530196,731,0002,117,0002,142,208
2Aug 18, 2026 04:244,652139,561,856196,515,0002,132,0002,142,208
3Aug 18, 2026 04:244,654139,628,569196,145,0002,116,0002,142,208
4Aug 18, 2026 04:244,659139,799,201196,476,0002,116,0002,142,208
5Aug 18, 2026 04:244,661139,833,706197,008,0002,098,0002,142,208
6Aug 18, 2026 04:244,663139,890,671196,461,0002,116,0002,142,208
7Aug 18, 2026 04:244,673140,207,105196,676,0002,080,0002,142,208
8Aug 18, 2026 04:244,687140,611,065197,785,0002,113,0002,142,208
9Aug 18, 2026 04:244,769143,072,123200,655,0003,133,0002,142,208