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 listMay 1, 2026 08:31Dominique GarmierDominique GarmierScore: 7,692Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 08:327,597227,927,050579,811,00010,014,0002,498,560
2May 1, 2026 08:327,668230,068,966578,810,00011,015,0002,781,184
3May 1, 2026 08:327,675230,277,779586,789,0008,966,0002,486,272
4May 1, 2026 08:327,679230,370,080579,086,0009,984,0002,732,032
5May 1, 2026 08:327,692230,762,869581,638,0009,976,0002,490,368
6May 1, 2026 08:327,693230,800,525580,793,0008,996,0002,760,704
7May 1, 2026 08:327,802234,071,262582,310,0009,988,0002,564,096
8May 1, 2026 08:327,811234,354,448593,557,0008,978,0002,490,368
9May 1, 2026 08:327,853235,614,175601,395,00010,952,0002,486,272