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 16, 2026 06:36M-RochatM-RochatScore: 115,706Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 06:37115,1993,455,974,1303,349,154,00093,943,0002,117,632
2May 16, 2026 06:37115,2673,458,020,2073,350,852,00093,478,0002,117,632
3May 16, 2026 06:37115,4013,462,047,5773,356,630,00094,262,0002,117,632
4May 16, 2026 06:37115,5913,467,753,5813,358,272,00095,142,0002,117,632
5May 16, 2026 06:37115,7063,471,201,9923,357,818,000100,437,0002,117,632
6May 16, 2026 06:37115,7323,471,982,7593,360,875,00099,919,0002,117,632
7May 16, 2026 06:37115,7933,473,800,4103,361,263,00099,004,0002,117,632
8May 16, 2026 06:37115,9223,477,662,5103,368,545,00095,049,0002,113,536
9May 16, 2026 06:37116,7543,502,621,1493,389,250,00098,865,0002,117,632