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 15, 2026 06:43Tomislav TunkovicTomislav TunkovicScore: 2,858Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 06:442,81084,322,308211,722,00011,983,0002,170,880
2Aug 15, 2026 06:442,81984,584,148212,262,00011,443,0002,162,688
3Aug 15, 2026 06:442,82984,886,207209,798,00011,720,0002,162,688
4Aug 15, 2026 06:442,84485,333,913215,899,00011,188,0002,158,592
5Aug 15, 2026 06:442,85885,747,632211,591,00011,715,0002,162,688
6Aug 15, 2026 06:442,87686,284,259214,726,00011,561,0002,158,592
7Aug 15, 2026 06:442,90187,056,968214,769,00011,407,0002,162,688
8Aug 15, 2026 06:442,93388,002,638218,105,00011,392,0002,162,688
9Aug 15, 2026 06:443,01890,554,057225,503,00010,690,0002,162,688