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 listAug 18, 2026 04:27Josu San MartinJosu San MartinScore: 4,697Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 04:314,648139,458,807196,511,0003,349,0002,187,264
2Aug 18, 2026 04:314,656139,685,186196,720,0003,373,0002,187,264
3Aug 18, 2026 04:314,658139,744,797197,484,0003,438,0002,187,264
4Aug 18, 2026 04:314,693140,801,840197,635,0003,386,0002,187,264
5Aug 18, 2026 04:314,697140,934,296197,702,0003,367,0002,187,264
6Aug 18, 2026 04:314,724141,742,499199,455,0003,132,0002,187,264
7Aug 18, 2026 04:314,727141,813,246200,673,0003,185,0002,187,264
8Aug 18, 2026 04:314,760142,811,526198,863,0003,156,0002,256,896
9Aug 18, 2026 04:314,791143,734,375202,096,0003,202,0002,203,648