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 3, 2026 19:14TudyMTudyMScore: 36,827Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 19:1734,5151,035,460,3521,011,057,0008,027,0002,564,096
2May 3, 2026 19:1735,4971,064,918,6111,040,309,0008,016,0002,564,096
3May 3, 2026 19:1736,2741,088,238,5041,062,496,0007,019,0002,560,000
4May 3, 2026 19:1736,7831,103,496,4261,079,019,0007,453,0002,572,288
5May 3, 2026 19:1736,8271,104,821,6421,078,130,0007,020,0002,560,000
6May 3, 2026 19:1736,9461,108,404,8821,085,615,0007,026,0002,568,192
7May 3, 2026 19:1737,7211,131,640,3141,107,293,0008,067,0002,568,192
8May 3, 2026 19:1737,7851,133,561,8211,103,662,00010,370,0002,539,520
9May 3, 2026 19:1741,5291,245,873,7731,205,827,00010,222,0002,564,096