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 24, 2026 09:15Victor 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
1Aug 24, 2026 09:16050,332,195120,017,0001,312,0002,170,880expected "1023527 ", got "1023526 "stderr
2Aug 24, 2026 09:16050,057,691119,535,0001,009,0002,170,880expected "1022045 ", got "1022044 "stderr
3Aug 24, 2026 09:161,66549,950,377118,242,0002,022,0002,170,880stderr
4Aug 24, 2026 09:161,68150,446,435119,403,0002,032,0002,170,880stderr
5Aug 24, 2026 09:161,69650,893,053119,740,0001,007,0002,170,880stderr
6Aug 24, 2026 09:161,69950,976,204119,215,0001,008,0002,170,880stderr
7Aug 24, 2026 09:161,71651,488,648122,226,0002,022,0002,170,880stderr
8Aug 24, 2026 09:161,71651,499,041121,345,0001,020,0002,170,880stderr
9Aug 24, 2026 09:161,71951,591,435123,010,0001,032,0002,170,880stderr