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 20:09TudyMTudyMScore: 132,015Success
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 20:12101,8653,055,978,3561,818,147,000656,132,0002,392,064
2May 3, 2026 20:12120,4403,613,216,7501,842,165,000630,621,0002,555,904
3May 3, 2026 20:12123,5773,707,315,4931,901,052,000825,756,0002,760,704
4May 3, 2026 20:12131,6893,950,674,0951,867,503,000653,641,0002,785,280
5May 3, 2026 20:12132,0153,960,463,4991,897,241,000865,647,0002,514,944
6May 3, 2026 20:12138,8374,165,136,3091,890,286,000853,949,0002,772,992
7May 3, 2026 20:12151,4194,542,586,3271,898,131,000832,317,0002,535,424
8May 3, 2026 20:12158,9514,768,546,7821,935,172,000850,952,0002,756,608
9May 3, 2026 20:12163,2254,896,756,7021,948,956,000870,415,0002,809,856