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 24, 2026 05:12Dominique GarmierDominique GarmierScore: 58,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 05:1257,3121,719,366,4941,684,471,00011,009,0002,408,448
2Mar 23, 2026 23:1157,4661,723,975,6991,682,759,00013,013,0002,621,440
3Mar 23, 2026 23:1157,8831,736,485,5821,704,800,0009,987,0002,498,560
4Mar 24, 2026 05:1258,6291,758,878,0901,724,059,00012,007,0002,547,712
5Mar 24, 2026 05:1259,1121,773,355,4941,732,566,0009,008,0002,490,368
6Mar 23, 2026 23:1161,4191,842,555,4041,799,854,00013,998,0002,633,728