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 21, 2026 18:37Dominique GarmierDominique GarmierScore: 8,323Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 18:378,167244,995,733589,561,00014,988,0002,387,968
2Mar 21, 2026 18:378,182245,459,317593,844,00016,995,0002,338,816
3Mar 21, 2026 18:378,254247,612,613595,869,00012,975,0002,383,872
4Mar 21, 2026 18:378,312249,359,473594,103,00011,981,0002,347,008
5Mar 21, 2026 18:378,323249,691,700615,030,00013,977,0002,383,872
6Mar 21, 2026 18:378,353250,583,625595,543,00014,988,0002,482,176
7Mar 21, 2026 18:378,405252,136,991618,316,00016,953,0002,596,864
8Mar 21, 2026 18:3711,563346,902,310606,993,00012,999,0002,441,216
9Mar 21, 2026 18:3711,735352,063,404606,829,00017,965,0002,449,408