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 listJun 26, 2026 17:37Shikhar SoniShikhar SoniScore: 36,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 17:3836,4041,092,121,0811,071,124,00010,948,0002,129,920
2Jun 26, 2026 17:3836,4541,093,638,1621,072,167,00011,227,0002,129,920
3Jun 26, 2026 17:3836,4771,094,331,1221,072,768,00011,379,0002,129,920
4Jun 26, 2026 17:3836,5081,095,244,9611,074,160,00010,979,0002,129,920
5Jun 26, 2026 17:3836,5451,096,364,0741,074,870,00011,015,0002,129,920
6Jun 26, 2026 17:3836,5461,096,407,4871,073,970,00011,901,0002,129,920
7Jun 26, 2026 17:3836,5911,097,737,0721,075,971,00011,121,0002,129,920
8Jun 26, 2026 17:3836,5971,097,912,8851,075,311,00012,035,0002,129,920
9Jun 26, 2026 17:3836,6781,100,353,6781,079,540,00010,223,0002,129,920