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 listMar 22, 2026 19:50Dominique GarmierDominique GarmierScore: 199,038Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 18:05196,3925,891,768,7115,855,651,0009,994,0002,555,904
2Mar 25, 2026 17:16196,8975,906,900,4745,871,817,00010,992,0002,654,208
3Mar 25, 2026 17:16197,2525,917,574,9595,879,217,0009,993,0002,646,016
4Mar 22, 2026 18:05198,3725,951,170,9215,914,856,0009,994,0002,605,056
5Mar 25, 2026 17:16199,0385,971,139,6105,924,224,00010,994,0002,658,304
6Mar 22, 2026 18:05200,6366,019,081,5535,981,491,00010,993,0002,596,864
7Mar 22, 2026 19:50201,5846,047,533,6226,004,455,00013,989,0002,760,704
8Mar 22, 2026 19:50201,8346,055,018,4286,012,248,00011,992,0002,539,520
9Mar 22, 2026 19:50202,0496,061,466,7716,027,036,0009,995,0002,760,704