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 17, 2026 12:35Tomislav TunkovicTomislav TunkovicScore: 1,798Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 12:461,78253,470,761124,271,0003,100,00065,536
2Aug 17, 2026 12:461,79253,776,950124,763,0003,018,00065,536
3Aug 17, 2026 12:461,79353,809,450124,343,0003,182,00065,536
4Aug 17, 2026 12:461,79753,913,518124,945,0003,209,00065,536
5Aug 17, 2026 12:461,79853,967,629125,487,0003,056,00065,536
6Aug 17, 2026 12:461,80454,141,221125,556,0003,076,00065,536
7Aug 17, 2026 12:461,81154,359,375126,316,0003,339,00065,536
8Aug 17, 2026 12:461,81254,363,800126,082,0003,097,00065,536
9Aug 17, 2026 12:461,86055,827,175126,316,0003,295,00065,536