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 listOct 6, 2026 07:30Karthik ReddyKarthik ReddyScore: 1,566Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 6, 2026 07:311,53145,957,738107,012,0000454,656
2Oct 6, 2026 07:311,54446,348,664107,622,0000462,848
3Oct 6, 2026 07:311,55046,516,274105,483,0000454,656
4Oct 6, 2026 07:311,56346,896,766109,820,0000458,752
5Oct 6, 2026 07:311,56647,009,310107,794,0000446,464
6Oct 6, 2026 07:311,57847,351,659110,782,0000450,560
7Oct 6, 2026 07:311,58147,438,925110,322,0000462,848
8Oct 6, 2026 07:311,58447,532,692108,455,0000466,944
9Oct 6, 2026 07:311,59447,841,809109,585,0000462,848