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 listApr 28, 2026 18:40Victor MerckléVictor MerckléScore: 7,836Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 18:417,556226,709,819564,800,00037,919,0002,666,496
2Apr 28, 2026 18:417,625228,779,859568,608,00047,967,0002,842,624
3Apr 28, 2026 18:417,650229,509,865561,967,00042,997,0002,691,072
4Apr 28, 2026 18:417,669230,091,856550,535,00042,963,0002,506,752
5Apr 28, 2026 18:417,836235,095,712566,929,00050,993,0002,936,832
6Apr 28, 2026 18:417,845235,361,804574,603,00044,046,0002,838,528
7Apr 28, 2026 18:417,917237,520,537560,569,00047,047,0002,453,504
8Apr 28, 2026 18:417,924237,730,768568,939,00048,994,0003,018,752
9Apr 28, 2026 18:418,157244,730,183574,654,00044,050,0002,613,248