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 01:07Victor 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
1Jun 26, 2026 01:080139,312,591246,773,0004,496,0002,658,304expected "1025385 ", got "1025384 "
2Jun 26, 2026 01:084,522135,678,510241,096,0004,326,0002,658,304
3Jun 26, 2026 01:084,590137,714,722252,058,0003,208,0002,654,208
4Jun 26, 2026 01:084,619138,592,633243,567,0004,420,0002,654,208
5Jun 26, 2026 01:084,624138,723,040247,092,0003,356,0002,654,208
6Jun 26, 2026 01:084,636139,087,262245,097,0004,397,0002,658,304
7Jun 26, 2026 01:084,637139,134,343252,455,0003,211,0002,658,304
8Jun 26, 2026 01:084,643139,314,325245,963,0003,381,0002,658,304
9Jun 26, 2026 01:084,652139,575,216248,377,0003,462,0002,658,304