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 18:49Tomislav TunkovicTomislav TunkovicScore: 1,782Success
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 18:501,74652,407,681127,032,0001,075,00065,536
2Aug 15, 2026 18:501,76052,819,235127,325,0001,006,00065,536
3Aug 15, 2026 18:501,76652,984,798126,624,0001,999,00065,536
4Aug 15, 2026 18:501,77453,221,825127,987,0001,129,00065,536
5Aug 15, 2026 18:501,78253,471,453126,268,0002,010,00065,536
6Aug 15, 2026 18:501,78953,699,350126,684,0002,011,00065,536
7Aug 15, 2026 18:501,80254,085,523128,260,0001,006,00065,536
8Aug 15, 2026 18:501,81554,459,455127,883,0002,137,00065,536
9Aug 15, 2026 18:501,82754,823,543126,844,0002,025,00065,536