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 14:36Victor MerckléVictor MerckléScore: 3,172Success
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 14:373,14394,307,909244,437,0001,136,0002,392,064
2Jun 11, 2026 14:373,16594,953,532245,914,0002,121,0002,387,968
3Jun 11, 2026 14:373,16694,981,495246,281,0002,130,0002,392,064
4Jun 11, 2026 14:373,16795,013,381245,920,0002,206,0002,396,160
5Jun 11, 2026 14:373,17295,178,971245,870,0001,115,0002,396,160
6Jun 11, 2026 14:373,21096,301,253250,129,0002,161,0002,392,064
7Jun 11, 2026 14:373,21296,381,274251,669,0001,010,0002,392,064
8Jun 11, 2026 14:373,23096,926,832253,573,0001,007,0002,654,208
9Jun 11, 2026 14:373,23396,995,322251,455,0002,132,0002,392,064