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 26, 2026 00:36Victor MerckléVictor MerckléScore: 2,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 00:372,93588,068,174235,170,0003,178,0002,662,400
2Jun 26, 2026 00:372,93788,122,794235,405,0003,148,0002,662,400
3Jun 26, 2026 00:372,94188,254,842235,057,0003,152,0002,662,400
4Jun 26, 2026 00:372,94288,276,239235,958,0003,092,0002,662,400
5Jun 26, 2026 00:372,95088,514,771236,428,0003,125,0002,662,400
6Jun 26, 2026 00:373,00190,044,518238,787,0002,051,0002,658,304
7Jun 26, 2026 00:373,00290,070,427237,860,0003,115,0002,658,304
8Jun 26, 2026 00:373,01190,336,220238,290,0002,047,0002,662,400
9Jun 26, 2026 00:373,03891,152,330239,882,0002,073,0002,662,400