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 listApr 24, 2026 17:48olliecrowolliecrowScore: 6,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 17:505,939178,192,162437,249,00010,005,0002,805,760
2Apr 24, 2026 17:505,973179,213,923439,688,0009,970,0002,760,704
3Apr 24, 2026 17:505,978179,341,207451,811,0008,996,0002,801,664
4Apr 24, 2026 17:505,992179,774,223440,988,0008,979,0002,756,608
5Apr 24, 2026 17:506,026180,799,163438,770,0009,994,0002,756,608
6Apr 24, 2026 17:506,051181,541,931442,210,00010,027,0002,789,376
7Apr 24, 2026 17:506,069182,094,497451,154,0009,981,0002,752,512
8Apr 24, 2026 17:506,099182,977,899442,068,0009,001,0002,580,480
9Apr 24, 2026 17:506,105183,151,474441,955,0008,978,0002,797,568