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 5, 2026 07:22olliecrowolliecrowScore: 17,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 07:2316,864505,930,999446,898,00043,271,0002,367,488
2May 5, 2026 07:2317,071512,158,929449,186,00043,381,0002,359,296
3May 5, 2026 07:2317,134514,021,772452,241,00043,015,0002,584,576
4May 5, 2026 07:2317,149514,490,538454,202,00042,963,0002,355,200
5May 5, 2026 07:2317,216516,502,023455,289,00043,048,0002,555,904
6May 5, 2026 07:2317,300519,012,994459,979,00042,993,0002,371,584
7May 5, 2026 07:2317,324519,728,343458,838,00043,210,0002,584,576
8May 5, 2026 07:2317,436523,097,201459,762,00043,210,0002,342,912
9May 5, 2026 07:2317,483524,513,526464,292,00043,208,0002,322,432