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: 20,425Success
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:5820,325609,757,853594,873,0004,036,0002,113,536
2May 18, 2026 01:5820,346610,398,768593,808,0004,020,0002,113,536
3May 18, 2026 01:5820,361610,856,354595,503,0004,145,0002,113,536
4May 18, 2026 01:5820,370611,119,456596,027,0004,015,0002,113,536
5May 18, 2026 01:5820,425612,758,294596,932,0004,022,0002,113,536
6May 18, 2026 01:5820,430612,924,627597,517,0004,067,0002,113,536
7May 18, 2026 01:5822,081662,449,673648,578,0004,016,0002,113,536
8May 18, 2026 01:5822,095662,866,153649,225,0004,045,0002,113,536
9May 18, 2026 01:5822,228666,854,410650,574,0004,032,0002,113,536