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 14:14TudyMTudyMScore: 10,960Success
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 14:1510,647319,426,697860,834,00019,972,0002,875,392
2Apr 29, 2026 14:1510,678320,357,155867,957,00012,969,0002,699,264
3Apr 29, 2026 14:1510,710321,315,374861,539,00019,011,0002,801,664
4Apr 29, 2026 14:1510,749322,487,674859,125,00021,977,0002,691,072
5Apr 29, 2026 14:1510,960328,800,526880,963,00014,015,0002,850,816
6Apr 29, 2026 14:1511,213336,416,623919,760,00017,995,0002,797,568
7Apr 29, 2026 14:1511,293338,795,825922,605,00013,994,0002,805,760
8Apr 29, 2026 14:1511,365340,975,146923,475,00013,992,0002,498,560
9Apr 29, 2026 14:1511,398341,941,037924,701,00011,996,0002,641,920