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 listOct 31, 2026 08:15Andrew EpsteinAndrew EpsteinScore: 1,564Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 08:311,53045,917,20799,423,0002,015,0002,224,128stderr
2Oct 31, 2026 08:311,54046,205,229100,377,0002,028,0002,179,072stderr
3Oct 31, 2026 08:311,55346,612,324101,587,0002,010,0002,224,128stderr
4Oct 31, 2026 08:311,55346,592,307101,274,0002,064,0002,179,072stderr
5Oct 31, 2026 08:311,56446,927,358102,462,0002,037,0002,183,168stderr
6Oct 31, 2026 08:311,56446,949,928102,937,0002,000,0002,183,168stderr
7Oct 31, 2026 08:311,57847,348,791105,061,0001,008,0002,179,072stderr
8Oct 31, 2026 08:311,59247,774,884104,638,0002,028,0002,183,168stderr
9Oct 31, 2026 08:311,61048,315,462102,160,0002,102,0002,179,072stderr