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 listSep 1, 2026 06:38Victor MerckléVictor MerckléScore: 1,941Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 06:401,91157,337,316140,314,0002,024,0002,691,072stderr
2Sep 1, 2026 06:401,91757,530,956140,317,0002,029,0002,646,016stderr
3Sep 1, 2026 06:401,92157,653,381140,878,0001,044,0002,695,168stderr
4Sep 1, 2026 06:401,92957,898,160141,812,0002,015,0002,646,016stderr
5Sep 1, 2026 06:401,94158,234,679141,051,0002,037,0002,695,168stderr
6Sep 1, 2026 06:401,95158,549,646141,714,0001,026,0002,691,072stderr
7Sep 1, 2026 06:401,95358,598,579140,636,0002,023,0002,695,168stderr
8Sep 1, 2026 06:401,95558,657,098141,920,0002,015,0002,646,016stderr
9Sep 1, 2026 06:401,95858,741,489142,145,0001,023,0002,695,168stderr