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 5, 2026 12:43Victor MerckléVictor MerckléScore: 5,253Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 12:495,162154,877,498424,680,00013,436,0002,715,648
2May 5, 2026 12:495,216156,506,953428,852,00011,169,0002,711,552
3May 5, 2026 12:495,228156,866,727429,150,00014,085,0002,678,784
4May 5, 2026 12:495,237157,111,723430,824,00012,585,0002,711,552
5May 5, 2026 12:495,253157,590,406436,562,00010,099,0002,977,792
6May 5, 2026 12:495,273158,201,366430,019,00010,357,0002,990,080
7May 5, 2026 12:495,273158,212,130434,798,00012,183,0002,985,984
8May 5, 2026 12:495,275158,276,154429,339,00011,131,0002,711,552
9May 5, 2026 12:495,324159,729,447426,528,00013,921,0002,715,648