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 28, 2026 10:49Victor MerckléVictor MerckléScore: 9,604Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 10:509,318279,544,672728,231,00016,005,0002,424,832
2Apr 28, 2026 10:509,390281,724,695729,435,00015,029,0002,494,464
3Apr 28, 2026 10:509,397281,910,891730,350,00013,949,0002,641,920
4Apr 28, 2026 10:509,418282,552,854729,027,00014,019,0002,613,248
5Apr 28, 2026 10:509,604288,131,080744,848,00014,996,0002,633,728
6Apr 28, 2026 10:509,668290,061,545762,334,00015,006,0002,375,680
7Apr 28, 2026 10:509,721291,642,156759,452,00015,946,0002,334,720
8Apr 28, 2026 10:509,884296,543,508760,944,00012,981,0002,371,584
9Apr 28, 2026 10:509,901297,035,680757,020,00018,925,0002,416,640