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 6, 2026 13:57olliecrowolliecrowScore: 13,447Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2026 13:5913,207396,229,259372,475,0009,310,0002,498,560
2May 6, 2026 13:5913,345400,371,853374,751,0009,634,0002,498,560
3May 6, 2026 13:5913,416402,495,724374,443,0009,341,0002,490,368
4May 6, 2026 13:5913,440403,207,878375,057,0009,891,0002,490,368
5May 6, 2026 13:5913,447403,430,747377,139,0009,716,0002,498,560
6May 6, 2026 13:5913,491404,756,416379,062,0009,690,0002,482,176
7May 6, 2026 13:5913,524405,747,534378,529,0009,736,0002,498,560
8May 6, 2026 13:5913,553406,604,410381,210,0009,508,0002,486,272
9May 6, 2026 13:5913,616408,495,487383,210,0009,594,0002,498,560