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 17, 2026 00:37M-RochatM-RochatScore: 86,196Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 00:3986,1162,583,501,5472,555,583,00017,013,0002,146,304
2May 17, 2026 00:3986,1462,584,402,1032,556,693,00016,051,0002,146,304
3May 17, 2026 00:3986,1482,584,449,2392,556,484,00017,108,0002,146,304
4May 17, 2026 00:3986,1602,584,828,7232,556,448,00017,070,0002,146,304
5May 17, 2026 00:3986,1962,585,884,4642,558,979,00016,062,0002,146,304
6May 17, 2026 00:3986,2552,587,658,7922,556,404,00018,104,0002,146,304
7May 17, 2026 00:3986,2632,587,900,6442,561,110,00016,031,0002,146,304
8May 17, 2026 00:3986,2732,588,198,8422,557,110,00017,026,0002,150,400
9May 17, 2026 00:3986,2952,588,851,0702,556,062,00018,260,0002,146,304