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 listSep 26, 2026 19:50Kevin HeaveyKevin HeaveyScore: 1,548Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 19:521,53145,946,671108,682,0002,026,000593,920
2Sep 26, 2026 19:521,53245,983,913108,847,0002,010,000589,824
3Sep 26, 2026 19:521,54146,259,458109,992,0001,021,000589,824
4Sep 26, 2026 19:521,54746,424,132109,497,0002,018,000589,824
5Sep 26, 2026 19:521,54846,467,770109,570,0002,008,000589,824
6Sep 26, 2026 19:521,60048,028,537109,050,0002,026,000589,824
7Sep 26, 2026 19:521,61248,368,664111,572,0001,023,000593,920
8Sep 26, 2026 19:521,62348,690,631112,541,0001,035,000593,920
9Sep 26, 2026 19:521,63048,919,913112,186,0001,011,000573,440