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 4, 2026 23:27olliecrowolliecrowScore: 13,225Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 23:2813,005390,150,893362,368,0009,558,0002,420,736
2May 4, 2026 23:2813,095392,868,173365,794,0008,970,0002,404,352
3May 4, 2026 23:2813,110393,311,021366,548,0008,892,0002,416,640
4May 4, 2026 23:2813,175395,262,436368,739,0009,098,0002,412,544
5May 4, 2026 23:2813,225396,757,634368,244,0009,558,0002,387,968
6May 4, 2026 23:2813,257397,736,801370,272,0009,447,0002,416,640
7May 4, 2026 23:2813,288398,667,297369,937,0009,050,0002,416,640
8May 4, 2026 23:2813,295398,850,822372,653,0009,002,0002,416,640
9May 4, 2026 23:2813,297398,938,947373,428,0009,499,0002,416,640