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 listApr 29, 2026 01:51Charles CabergsCharles CabergsScore: 12,133Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 01:5211,850355,519,8251,009,887,0007,983,0002,801,664
2Apr 29, 2026 01:5211,979359,384,6621,008,754,00010,997,0002,596,864
3Apr 29, 2026 01:5212,020360,617,4501,006,602,0008,987,0003,039,232
4Apr 29, 2026 01:5212,032360,973,0731,013,082,0008,991,0002,760,704
5Apr 29, 2026 01:5212,133363,993,6611,014,437,0006,989,0002,809,856
6Apr 29, 2026 01:5212,145364,350,2041,025,268,0007,986,0002,777,088
7Apr 29, 2026 01:5212,146364,384,9801,016,944,00014,955,0002,998,272
8Apr 29, 2026 01:5212,266368,005,0861,036,471,0009,966,0002,809,856
9Apr 29, 2026 01:5212,307369,227,9831,026,040,00010,989,0002,838,528