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:08TudyMTudyMScore: 31,910Success
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:1230,948928,447,683898,941,00014,177,0002,510,848
2May 3, 2026 19:1230,965928,951,378898,715,00014,123,0002,514,944
3May 3, 2026 19:1231,413942,414,703912,617,00015,341,0002,502,656
4May 3, 2026 19:1231,654949,649,068912,945,00016,539,0002,404,352
5May 3, 2026 19:1231,910957,323,104926,671,00015,179,0002,523,136
6May 3, 2026 19:1232,063961,919,735929,887,00015,520,0002,396,160
7May 3, 2026 19:1232,114963,430,087930,086,00015,378,0002,523,136
8May 3, 2026 19:1232,255967,663,333935,360,00015,404,0002,519,040
9May 3, 2026 19:1233,6501,009,520,105974,046,00016,526,0002,523,136