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 21, 2026 17:26M-RochatM-RochatScore: 22,606Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 17:2721,799653,974,951639,937,0004,038,0002,113,536
2May 21, 2026 17:2721,924657,733,097641,993,0004,025,0002,113,536
3May 21, 2026 17:2722,047661,436,666647,280,0004,007,0002,113,536
4May 21, 2026 17:2722,431672,954,381656,862,0004,283,0002,113,536
5May 21, 2026 17:2722,606678,192,497663,714,0004,052,0002,113,536
6May 21, 2026 17:2723,322699,678,203685,669,0004,168,0002,113,536
7May 21, 2026 17:2723,414702,423,033688,150,0004,312,0002,113,536
8May 21, 2026 17:2723,578707,366,260693,221,0004,218,0002,113,536
9May 21, 2026 17:2723,658709,758,922694,253,0004,260,0002,113,536