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 10:04M-RochatM-RochatScore: 22,058Success
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 10:0621,762652,887,946638,676,0004,289,0002,113,536
2May 21, 2026 10:0621,779653,384,388639,232,0004,011,0002,113,536
3May 21, 2026 10:0621,899656,988,629640,716,0004,017,0002,113,536
4May 21, 2026 10:0621,959658,786,788642,681,0004,099,0002,113,536
5May 21, 2026 10:0622,058661,749,777648,220,0004,097,0002,113,536
6May 21, 2026 10:0622,189665,686,365650,141,0004,039,0002,113,536
7May 21, 2026 10:0622,203666,115,123652,022,0004,058,0002,113,536
8May 21, 2026 10:0622,311669,351,532655,593,0004,276,0002,113,536
9May 21, 2026 10:0622,368671,043,301654,507,0004,152,0002,113,536