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 11, 2026 15:01Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 15:02092,424,256242,732,0001,022,0002,646,016expected "1020835 ", got "1020834 "
2Jun 11, 2026 15:023,07292,182,982242,282,0001,051,0002,650,112
3Jun 11, 2026 15:023,12193,635,157246,512,0001,031,0002,646,016
4Jun 11, 2026 15:023,14994,472,264246,387,0001,027,0002,654,208
5Jun 11, 2026 15:023,15294,562,119246,850,0001,010,0002,654,208
6Jun 11, 2026 15:023,15694,692,705247,914,0001,016,0002,654,208
7Jun 11, 2026 15:023,18995,694,971248,870,0001,021,0002,654,208
8Jun 11, 2026 15:023,19395,797,887245,949,0002,015,0002,654,208
9Jun 11, 2026 15:023,20796,227,412248,781,0001,015,0002,650,112