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 16:52Shikhar SoniShikhar SoniScore: 42,285Success
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 16:5342,2631,267,905,1671,206,006,00051,977,0002,117,632
2Jun 26, 2026 16:5342,2741,268,222,3841,205,280,00052,854,0002,117,632
3Jun 26, 2026 16:5342,2771,268,322,5541,203,705,00054,639,0002,117,632
4Jun 26, 2026 16:5342,2811,268,459,6001,205,827,00052,696,0002,117,632
5Jun 26, 2026 16:5342,2851,268,561,7691,204,866,00053,670,0002,117,632
6Jun 26, 2026 16:5342,3011,269,041,0391,203,464,00055,529,0002,117,632
7Jun 26, 2026 16:5342,3121,269,382,1321,203,949,00055,411,0002,117,632
8Jun 26, 2026 16:5342,3221,269,662,0171,203,786,00055,800,0002,117,632
9Jun 26, 2026 16:5342,3701,271,116,0711,205,946,00055,098,0002,117,632