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:26Victor MerckléVictor MerckléScore: 17,494Success
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:2817,280518,411,340455,090,00044,910,0002,379,776
2Apr 28, 2026 18:2817,394521,825,395457,494,00045,849,0002,367,488
3Apr 28, 2026 18:2817,457523,731,161460,396,00043,942,0002,375,680
4Apr 28, 2026 18:2817,477524,333,533454,957,00045,894,0002,379,776
5Apr 28, 2026 18:2817,494524,824,717461,990,00045,899,0002,371,584
6Apr 28, 2026 18:2817,495524,864,406457,591,00045,858,0002,547,712
7Apr 28, 2026 18:2817,546526,392,327465,031,00042,910,0002,375,680
8Apr 28, 2026 18:2817,615528,468,074462,162,00045,916,0002,379,776
9Apr 28, 2026 18:2817,642529,283,562462,795,00045,880,0002,383,872