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 listJul 8, 2026 07:00Victor MerckléVictor MerckléScore: 3,042Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 07:043,00390,092,575232,392,0003,097,0002,674,688
2Jul 8, 2026 07:043,01690,501,174232,259,0003,690,0002,674,688
3Jul 8, 2026 07:043,01890,566,336233,540,0003,419,0002,674,688
4Jul 8, 2026 07:043,02690,807,724234,178,0003,687,0002,674,688
5Jul 8, 2026 07:043,04291,281,687235,096,0003,702,0002,670,592
6Jul 8, 2026 07:043,04891,441,841235,435,0003,648,0002,674,688
7Jul 8, 2026 07:043,05691,705,363236,737,0003,657,0002,678,784
8Jul 8, 2026 07:043,05991,792,404235,176,0003,415,0002,740,224
9Jul 8, 2026 07:043,06191,857,706237,371,0003,715,0002,674,688