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:28TudyMTudyMScore: 10,716Success
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:2910,578317,351,229857,979,00016,999,0002,727,936
2Apr 29, 2026 14:2910,623318,708,152859,939,00014,998,0002,662,400
3Apr 29, 2026 14:2910,658319,752,318859,296,00017,005,0002,826,240
4Apr 29, 2026 14:2910,684320,530,001862,072,00015,982,0002,637,824
5Apr 29, 2026 14:2910,716321,481,531867,738,00014,011,0002,772,992
6Apr 29, 2026 14:2910,716321,487,656862,727,00014,995,0002,732,032
7Apr 29, 2026 14:2910,726321,809,877862,077,00018,001,0002,592,768
8Apr 29, 2026 14:2910,775323,267,826863,262,00016,004,0002,908,160
9Apr 29, 2026 14:2911,226336,807,560913,814,00016,996,0002,883,584