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 11, 2026 00:46Victor MerckléVictor MerckléScore: 9,568Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 00:509,475284,251,192803,323,0006,921,0002,666,496
2Jun 11, 2026 00:509,479284,386,139802,756,0006,950,0002,404,352
3Jun 11, 2026 00:509,480284,409,719803,736,0006,821,0002,158,592
4Jun 11, 2026 00:509,531285,937,383807,627,0004,708,0002,666,496
5Jun 11, 2026 00:509,568287,045,402812,709,0006,737,0002,404,352
6Jun 11, 2026 00:509,574287,229,359808,618,0006,776,0002,482,176
7Jun 11, 2026 00:509,607288,236,299814,602,0007,077,0002,420,736
8Jun 11, 2026 00:509,662289,878,816820,122,0006,540,0002,420,736
9Jun 11, 2026 00:5010,517315,510,820892,944,0006,802,0002,404,352