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 03:50Josu San MartinJosu San MartinScore: 4,724Success
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 03:594,717141,537,299201,308,0002,150,0002,256,896
2Aug 18, 2026 03:594,720141,621,785200,440,0003,170,0002,187,264
3Aug 18, 2026 03:594,720141,621,459199,950,0003,348,0002,187,264
4Aug 18, 2026 03:594,723141,706,469200,196,0003,343,0002,187,264
5Aug 18, 2026 03:594,724141,745,042200,301,0003,153,0002,187,264
6Aug 18, 2026 03:594,724141,744,814200,472,0003,382,0002,187,264
7Aug 18, 2026 03:594,738142,152,058200,107,0003,195,0002,187,264
8Aug 18, 2026 03:594,754142,643,318200,798,0003,384,0002,187,264
9Aug 18, 2026 03:594,760142,825,302201,098,0003,220,0002,187,264