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 listNov 21, 2025 09:12izotoffizotoffScore: 32,092Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2025 09:1230,659919,766,929886,484,0005,002,0002,727,936
2Nov 21, 2025 03:0231,095932,846,356904,377,0004,001,0002,396,160
3Nov 21, 2025 03:0232,027960,819,512930,740,0004,998,0002,699,264
4Nov 21, 2025 03:0232,092962,767,120930,914,0006,005,0002,744,320
5Nov 21, 2025 09:1233,5631,006,899,522975,834,0005,998,0002,617,344
6Nov 21, 2025 09:1236,4191,092,584,4991,059,801,0004,989,0002,613,248