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 listJun 26, 2026 15:38Shikhar SoniShikhar SoniScore: 57,294Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 15:3956,9201,707,614,8631,533,292,000163,525,0002,117,632
2Jun 26, 2026 15:3957,0591,711,772,5231,540,882,000160,100,0002,117,632
3Jun 26, 2026 15:3957,1711,715,134,4591,542,599,000161,281,0002,117,632
4Jun 26, 2026 15:3957,2441,717,341,9341,550,171,000156,032,0002,117,632
5Jun 26, 2026 15:3957,2941,718,846,0511,545,118,000162,308,0002,117,632
6Jun 26, 2026 15:3957,3181,719,541,8171,545,139,000163,431,0002,117,632
7Jun 26, 2026 15:3957,4811,724,446,5931,551,037,000162,372,0002,117,632
8Jun 26, 2026 15:3957,5901,727,703,8851,543,570,000173,059,0002,117,632
9Jun 26, 2026 15:3957,6241,728,730,1671,555,128,000162,394,0002,117,632