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:55TudyMTudyMScore: 31,257Success
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 18:5730,240907,212,899880,089,00011,092,0002,539,520
2May 3, 2026 18:5730,349910,481,751881,417,00010,063,0002,547,712
3May 3, 2026 18:5730,583917,504,518887,918,00011,050,0002,551,808
4May 3, 2026 18:5730,648919,463,352890,056,00010,072,0002,564,096
5May 3, 2026 18:5731,257937,731,209906,658,00011,123,0002,539,520
6May 3, 2026 18:5731,592947,762,050921,531,00010,173,0002,547,712
7May 3, 2026 18:5731,657949,728,438924,241,00010,330,0002,539,520
8May 3, 2026 18:5731,716951,499,583925,118,00010,188,0002,551,808
9May 3, 2026 18:5731,736952,105,595924,721,00010,287,0002,396,160