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 listJun 26, 2026 00:55Victor MerckléVictor MerckléScore: 3,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 00:563,495104,859,588279,718,0003,134,0002,404,352
2Jun 26, 2026 00:563,500105,009,306279,600,0003,099,0002,404,352
3Jun 26, 2026 00:563,509105,270,311286,165,0003,176,0002,416,640
4Jun 26, 2026 00:563,519105,589,459282,240,0003,098,0002,408,448
5Jun 26, 2026 00:563,560106,804,821279,413,0003,165,0002,408,448
6Jun 26, 2026 00:563,587107,626,594288,897,0003,062,0002,416,640
7Jun 26, 2026 00:563,590107,706,723280,306,0003,042,0002,416,640
8Jun 26, 2026 00:563,615108,457,953294,478,0002,127,0002,416,640
9Jun 26, 2026 00:563,661109,836,032287,776,0003,110,0002,408,448