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 23, 2026 07:43Matthias GörgensMatthias GörgensScore: 2,541Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 07:442,52475,743,307187,662,0001,135,0002,166,784
2Sep 23, 2026 07:442,53375,999,051186,752,0002,031,0002,166,784
3Sep 23, 2026 07:442,53576,052,522186,688,0001,172,0002,166,784
4Sep 23, 2026 07:442,53776,112,018187,616,0001,128,0002,166,784
5Sep 23, 2026 07:442,54176,242,218187,597,0001,170,0002,166,784
6Sep 23, 2026 07:442,54276,284,104188,656,0001,132,0002,166,784
7Sep 23, 2026 07:442,54876,462,183186,741,0001,173,0002,166,784
8Sep 23, 2026 07:442,55476,635,061187,274,0001,002,0002,166,784
9Sep 23, 2026 07:442,57277,175,863186,876,0001,017,0002,166,784