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 3, 2026 18:59TudyMTudyMScore: 30,917Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 19:0230,671920,149,594891,236,00011,009,0002,564,096
2May 3, 2026 19:0230,704921,137,743893,045,00010,023,0002,396,160
3May 3, 2026 19:0230,727921,831,389890,397,00011,032,0002,560,000
4May 3, 2026 19:0230,842925,269,817896,386,00011,031,0002,555,904
5May 3, 2026 19:0230,917927,527,520897,899,00011,008,0002,543,616
6May 3, 2026 19:0230,966929,003,220899,537,00011,084,0002,547,712
7May 3, 2026 19:0232,171965,142,517938,167,00010,215,0002,551,808
8May 3, 2026 19:0232,208966,253,049940,126,00010,181,0002,531,328
9May 3, 2026 19:0232,273968,216,616937,669,00010,092,0002,551,808