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 18, 2026 01:56M-RochatM-RochatScore: 22,064Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:5920,493614,819,424599,544,0004,042,0002,113,536
2May 18, 2026 01:5920,633619,001,530604,753,0004,012,0002,113,536
3May 18, 2026 01:5920,704621,124,600605,473,0004,013,0002,113,536
4May 18, 2026 01:5922,029660,895,227645,151,0004,043,0002,113,536
5May 18, 2026 01:5922,064661,946,321646,813,0004,102,0002,113,536
6May 18, 2026 01:5922,075662,265,205647,995,0004,027,0002,113,536
7May 18, 2026 01:5922,102663,072,542648,314,0004,079,0002,113,536
8May 18, 2026 01:5922,152664,585,251648,238,0004,219,0002,113,536
9May 18, 2026 01:5922,153664,602,441650,741,0004,012,0002,113,536