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:56TudyMTudyMScore: 77,669Success
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:5877,1592,314,797,3262,233,838,00063,286,0002,494,464
2May 3, 2026 19:5877,3652,320,973,3892,241,787,00061,580,0002,490,368
3May 3, 2026 19:5877,4172,322,526,6232,237,788,00067,085,0002,498,560
4May 3, 2026 19:5877,4412,323,236,2002,242,146,00061,846,0002,502,656
5May 3, 2026 19:5877,6692,330,072,0672,249,679,00062,745,0002,494,464
6May 3, 2026 19:5877,7342,332,037,6882,247,656,00063,622,0002,490,368
7May 3, 2026 19:5877,7412,332,254,4162,249,575,00063,359,0002,486,272
8May 3, 2026 19:5877,8232,334,693,3982,252,877,00063,827,0002,486,272
9May 3, 2026 19:5878,1082,343,266,5382,258,905,00063,398,0002,498,560