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 listMay 16, 2026 08:49M-RochatM-RochatScore: 23,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 08:5023,489704,670,399691,425,0004,088,0002,113,536
2May 16, 2026 08:5023,517705,538,636692,034,0004,232,0002,113,536
3May 16, 2026 08:5023,574707,232,554693,225,0004,146,0002,113,536
4May 16, 2026 08:5023,678710,369,108694,212,0004,062,0002,113,536
5May 16, 2026 08:5023,702711,078,269697,753,0004,157,0002,113,536
6May 16, 2026 08:5023,885716,577,053698,430,0007,075,0002,113,536
7May 16, 2026 08:5026,643799,290,862784,634,0004,398,0002,113,536
8May 16, 2026 08:5026,656799,693,042785,342,0004,409,0002,113,536
9May 16, 2026 08:5026,713801,391,253786,110,0004,471,0002,113,536