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 9, 2026 22:43Victor MerckléVictor MerckléScore: 3,233Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 22:493,19395,794,803249,219,0001,176,0002,146,304
2Jun 9, 2026 22:493,19695,906,284250,928,0001,028,0002,142,208
3Jun 9, 2026 22:493,22696,785,810253,428,0001,039,0002,142,208
4Jun 9, 2026 22:493,22896,843,582253,161,0001,032,0002,142,208
5Jun 9, 2026 22:493,23397,003,961254,559,0001,044,0002,142,208
6Jun 9, 2026 22:493,23497,028,815252,578,0002,209,0002,142,208
7Jun 9, 2026 22:493,23497,026,641250,619,0001,182,0002,146,304
8Jun 9, 2026 22:493,23997,185,311252,763,0002,197,0002,142,208
9Jun 9, 2026 22:493,24797,413,370254,497,0001,111,0002,142,208