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 9, 2026 00:53Andrew EpsteinAndrew EpsteinScore: 7,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 00:547,582227,468,958600,837,00024,423,0002,179,072
2Sep 9, 2026 00:547,640229,211,192607,759,00024,798,0002,482,176
3Sep 9, 2026 00:547,645229,354,710597,351,00024,767,0002,482,176
4Sep 9, 2026 00:547,660229,817,494597,480,00026,737,0002,232,320
5Sep 9, 2026 00:547,708231,261,711605,978,00024,791,0002,338,816
6Sep 9, 2026 00:547,730231,925,740607,504,00024,852,0002,392,064
7Sep 9, 2026 00:547,760232,803,439594,307,00024,191,0002,244,608
8Sep 9, 2026 00:547,880236,425,719601,755,00024,834,0002,207,744
9Sep 9, 2026 00:547,946238,386,915605,451,00025,079,0002,383,872