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 listAug 2, 2026 13:25Victor MerckléVictor MerckléScore: 5,203Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 13:275,143154,299,358420,850,0009,921,0002,605,056stderr
2Aug 2, 2026 13:275,177155,320,516425,238,0009,368,0002,605,056stderr
3Aug 2, 2026 13:275,199155,991,780428,465,0009,028,0002,605,056stderr
4Aug 2, 2026 13:275,200156,003,869428,448,0009,093,0002,605,056stderr
5Aug 2, 2026 13:275,203156,096,443427,659,00010,027,0002,605,056stderr
6Aug 2, 2026 13:275,226156,790,457426,439,0008,565,0002,605,056stderr
7Aug 2, 2026 13:275,227156,832,543430,531,0009,111,0002,605,056stderr
8Aug 2, 2026 13:275,236157,081,819431,102,0009,775,0002,605,056stderr
9Aug 2, 2026 13:275,258157,747,068431,617,0008,010,0002,609,152stderr